BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Space Embedding of Records for Privacy Preserving Linkage - Vassil
 ios Verykios (Hellenic Open University)
DTSTART:20160914T090000Z
DTEND:20160914T093000Z
UID:TALK67351@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:<span>Massive amounts of data\, collected by a wide variety of
  organizations\, need to be integrated and matched in order to facilitate 
 data analyses that may be highly beneficial to businesses\, governments\, 
 and academia. Record linkage\, also known as entity resolution\, is the pr
 ocess of identifying records that refer to the same real-world entity from
  disparate data sets. Privacy Preserving Record Linkage (PPRL) techniques 
 are employed to perform the linkage process in a secure manner\, when the 
 data that need to be matched are sensitive. In PPRL\, input records underg
 o an anonymization process that embeds the records into a space\, where th
 e underlying data can be matched but not understood by naked eye.<br><br>T
 he PPRL problem is picking up a lot of steam lately due to a ubiquitous ne
 ed for cross matching of records that usually lack common unique identifie
 rs and their field values contain variations\, errors\, misspellings\, and
  typos. The PPRL process as it is applied to massive ammounts of data comp
 rises of an anonymization phase\, a searching phase and a matching phase.<
 br><br>Several searching and anonymization approaches have been developed 
 with the aim to scale the PPRL process to big data without sacrificing qua
 lity of the results. Recently\, redundant randomized methods have been pro
 posed\, which insert each record into multiple independent blocks in order
  to amplify the probability of bringing together similar records for compa
 rison. The key feature of these methods is the formal guarantees\, they pr
 ovide\, in terms of accuracy in the generated results.<br><br>In this talk
 \, we present both state-of-the-art private searching methods and anonynim
 ization techniques\, by exposing their characteristics\, including their s
 trengths&nbsp\;and weaknesses\, and we also present a comparative evaluati
 on.</span>
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR