DocumentCode :
2829089
Title :
Effective Privacy Preserved Clustering Based on Voronoi Diagram
Author :
Liu, Jinfei ; Luo, Jun ; Fan, Chenglin
Author_Institution :
Shenzhen Institutes of Adv. Technol., Chinese Acad. of Sci., Shenzhen, China
fYear :
2011
fDate :
28-30 June 2011
Firstpage :
206
Lastpage :
213
Abstract :
Consider a scenario like this: a data holder, such as a hospital (data publisher) wants to share patients´ data with researcher (data user). However, due to privacy issue, the hospital could not publish the exact original data while the published data need to retain as much as possible the correlation of the original data for utility consideration. The entire existing models for publishing private data could not perfectly resolve the tradeoff between privacy and utility of the private data. This paper presents a novel private information publishing model Semi-Delaunay Diagram (SDD) based on Voronoi diagram and gives a clustering algorithm VDC based on SDD. This model not only protects privacy but also achieves a perfect clustering correlation. Extensive experiments show the different clustering results with the different input area parameter, and confirm that our VDC algorithm discovers clusters with arbitrary shape as DBSCAN algorithm does.
Keywords :
computational geometry; data privacy; mesh generation; pattern clustering; SDD; VDC; Voronoi diagram; clustering algorithm; privacy preserved clustering; semiDelaunay diagram; Clustering algorithms; Data models; Data privacy; Privacy; Publishing; Shape; Voronoi diagram; clustering; data publishing; privacy preservation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Voronoi Diagrams in Science and Engineering (ISVD), 2011 Eighth International Symposium on
Conference_Location :
Qingdao
Print_ISBN :
978-1-4577-1026-1
Electronic_ISBN :
978-0-7695-4483-0
Type :
conf
DOI :
10.1109/ISVD.2011.35
Filename :
5988937
Link To Document :
بازگشت