A privacy preserving efficient protocol for semantic similarity join using long string attributes

During the similarity join process, one or more sources may not allow sharing the whole data with other sources. In this case, privacy preserved similarity join is required. We showed in our previous work [4] that using long attributes, such as paper abstracts, movie summaries, product descriptions, and user feedbacks, could improve the similarity join accuracy under supervised learning. However, the existing secure protocols for similarity join methods can not be used to join tables using these long attributes. Moreover, the majority of the existing privacy-preserving protocols did not consider the semantic similarities during the similarity join process. In this paper, we introduce a secure efficient protocol to semantically join tables when the join attributes are long attributes. Furthermore, instead of using machine learning methods, which are not always applicable, we use similarity thresholds to decide matched pairs. Results show that our protocol can efficiently join tables using the long attributes by considering the semantic relationships among the long string values. Therefore, it improves the overall secure similarity join performance.

[1]  Hanan Samet,et al.  Properties of Embedding Methods for Similarity Searching in Metric Spaces , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Stéphane Lafon,et al.  Diffusion maps , 2006 .

[3]  Farshad Fotouhi,et al.  Diffusion Maps: A Superior Semantic Method to Improve Similarity Join Performance , 2010, 2010 IEEE International Conference on Data Mining Workshops.

[4]  Alexandre V. Evfimievski,et al.  Information sharing across private databases , 2003, SIGMOD '03.

[5]  Ahmed K. Elmagarmid,et al.  Duplicate Record Detection: A Survey , 2007, IEEE Transactions on Knowledge and Data Engineering.

[6]  Xiaofei He,et al.  Locality Preserving Projections , 2003, NIPS.

[7]  Richard A. Harshman,et al.  Indexing by Latent Semantic Analysis , 1990, J. Am. Soc. Inf. Sci..

[8]  B. Nadler,et al.  Diffusion maps, spectral clustering and reaction coordinates of dynamical systems , 2005, math/0503445.

[9]  Driss Aboutajdine,et al.  Document clustering based on diffusion maps and a comparison of the k-means performances in various spaces , 2008, 2008 IEEE Symposium on Computers and Communications.

[10]  Malcolm I. Heywood,et al.  Comparing and Combining Dimension Reduction Techniques for Efficient Text Clustering , 2005 .

[11]  Elisa Bertino,et al.  Privacy preserving schema and data matching , 2007, SIGMOD '07.

[12]  Peter Christen,et al.  Some methods for blindfolded record linkage , 2004, BMC Medical Informatics Decis. Mak..

[13]  Dongwon Lee,et al.  Blocking-aware private record linkage , 2005, IQIS '05.

[14]  Benny Pinkas,et al.  Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.

[15]  Vassilios S. Verykios,et al.  Privacy Preserving Record Linkage Using Phonetic Codes , 2009, 2009 Fourth Balkan Conference in Informatics.