CS Colloquium Series @ UCY

Department of Computer Science - University of Cyprus

The Department of Computer Science at the University of Cyprus holds research colloquiums and social hours approximately once weekly. All university students, faculty, and staff are invited to attend. Notifications about new and upcoming events are automatically disseminated to a variety of institutional lists.
If you don't receive these notifications, but want to get informed about upcoming colloquium announcements, you can do the following:
mail List rss RSS Directions Directions

Colloquium Coordinator: Demetris Zeinalipour

Colloquium: Scalable Blocking for Privacy Preserving Record Linkage, Dr. Alexandros Karakasidis (University of Cyprus, Cyprus), Thursday, March 3, 2016, 19:15-20:15 EET.

The Department of Computer Science at the University of Cyprus cordially invites you to the Colloquium entitled:

Scalable Blocking for Privacy Preserving Record Linkage


Speaker: Dr. Alexandros Karakasidis
Affiliation: University of Cyprus, Cyprus
Category: Colloquium
Location: Room 148, Faculty of Pure and Applied Sciences (FST-01), 1 University Avenue, 2109 Nicosia, Cyprus (directions)
Date: Thursday, March 3, 2016
Time: 19:15-20:15 EET
Host: Yannis Dimopoulos (yannis-AT-cs.ucy.ac.cy)
URL: https://www.cs.ucy.ac.cy/colloquium/index.php?speaker=cs.ucy.2016.karakasidis

With the data explosion we have been experiencing recently, the problem of linking records that represent the same real world entity across various and often heterogeneous sources has become increasingly important for a number of application areas such as data integration, business intelligence, web mining and recommendation systems. When dealing with sensitive and personal user data, the process of record linkage raises privacy issues. Thus, privacy preserving record linkage has emerged with the goal of identifying matching records across multiple data sources while preserving the privacy of the individuals they describe. The task is very resource demanding, considering the abundance of available data, which, in addition, are often dirty. Blocking techniques are deployed prior to matching to prune out unlikely to match candidate records so as to reduce processing time. However, when scaling to large datasets, such methods often result in quality loss. In this talk, we will present a privacy preserving blocking technique providing high fault-tolerance and maintaining result quality while scaling linearly with respect to the dataset size.

Short Bio:
Alexandros Karakasidis received his BSc degree in Computer Science from the Department of Computer Science at the University of Ioannina, Greece in 2002 and his MSc also in Computer Science with specialization in Information Systems from the same department in 2005. He received his PhD degree in Computer Science from the School of Science and Technology at the Hellenic Open University, Greece in 2015. His research interests lie in the area of data management and especially in approximate data matching, privacy and data quality. Currently, he is a Marie Curie research fellow of the iSocial FP7 program at the Laboratory of Internet Computing, Department of Computer Science, University of Cyprus.

  Web: https://www.cs.ucy.ac.cy/colloquium/
  Mailing List: https://listserv.cs.ucy.ac.cy/mailman/listinfo/cs-colloquium
  RSS: https://www.cs.ucy.ac.cy/colloquium/rss.xml
  Calendar: https://www.cs.ucy.ac.cy/colloquium/schedule/cs.ucy.2016.karakasidis.ics

Sponsor: The CS Colloquium Series is supported by a generous donation from Microsoft