DocumentCode
3181505
Title
Employing bloom filters for privacy preserving distributed collaborative kNN classification
Author
Gorai, M.R. ; Sridharan, K.S. ; Aditya, T. ; Mukkamala, R. ; Nukavarapu, S.
Author_Institution
Dept. of Math. & Comput. Sci., Sri Sathya Sai Inst. of Higher Learning, Prashanti Nilayam, India
fYear
2011
fDate
11-14 Dec. 2011
Firstpage
495
Lastpage
500
Abstract
Increasingly, organizations are collecting users´ personal data to mine rules that describe user behavior. In addition, different organizations may want to collaborate to derive rules based on collective data. However, due to the privacy-preserving requirements, organizations may not be able to share their data directly with others. In the current work, we employ Bloom filters to hide the sensitive data while still being able to perform collaborative data mining. In particular, we experiment with the kNN classifier. Using the Euclidean distance and Jaccard similarity measures, we evaluate the efficacy of the proposed representation. Using some real data, we show that Bloom filters effectively preserve data privacy while maintaining the accuracy of classifications.
Keywords
data encapsulation; data mining; data privacy; data structures; groupware; pattern classification; probability; security of data; Bloom filters; Euclidean distance; Jaccard similarity measures; collaborative data mining; data privacy; data sharing; kNN classifier; personal data; privacy preserving distributed collaborative kNN classification; sensitive data hiding; Accuracy; Data privacy; Information filters; Measurement; Privacy; Jaccard similarity measure; bloom filters; collaborative data mining; kNN classifier; privacy-preserving data mining;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Communication Technologies (WICT), 2011 World Congress on
Conference_Location
Mumbai
Print_ISBN
978-1-4673-0127-5
Type
conf
DOI
10.1109/WICT.2011.6141295
Filename
6141295
Link To Document