A fast and efficient Hamming LSH-based scheme for accurate linkage

详细信息    查看全文

• 作者：Dimitrios Karapiperis ; Vassilios S. Verykios
• 关键词：Privacy ; preserving record linkage ; Locality ; sensitive hashing ; Blocking ; Bloom filters
• 刊名：Knowledge and Information Systems
• 出版年：2016
• 出版时间：December 2016
• 年：2016
• 卷：49
• 期：3
• 页码：861-884
• 全文大小：1,014 KB
• 刊物类别：Computer Science
• 刊物主题：Information Systems and Communication Service
  Business Information Systems
  
• 出版者：Springer London
• ISSN：0219-3116
• 卷排序：49

文摘

In this paper, we propose an efficient scheme for privacy-preserving record linkage by using the Hamming locality-sensitive hashing technique as the blocking mechanism and the Bloom filter-based encoding method for anonymizing the data sets at hand. We achieve highly accurate results and simultaneously reduce significantly the computational cost by minimizing the number of distance computations performed. Our scheme provides theoretical guarantees for identifying the similar anonymized record pairs by conducting redundant blocking and by performing a distance computation only if the corresponding anonymized record pair is formulated a specified number of times. A series of experiments illustrate the efficacy of our scheme in identifying the similar record pairs, while simultaneously keeping the running time exceptionally low.