Efficient Two-Party Private Blocking based on Sorted Nearest Neighborhood Clustering
Integrating data from diverse sources with the aim to identify similar records that refer to the same real-world entities without compromising privacy of these entities is an emerging research problem in various domains. This problem is known as privacy-p
|Collections||ANU Research Publications|
|Source:||Proceedings of the 22nd ACM international conference on Conference on information & knowledge management|
|01_Vatsalan_Efficient_Two-Party_Private_2013.pdf||1.93 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.