DocumentCode
3258024
Title
Privacy preservation in k-means clustering by cluster rotation
Author
Dhiraj, S. S Shivaji ; Khan, Ameer M Asif ; Khan, Wajhiulla ; Challagalla, Ajay
Author_Institution
Dept. of Comput. Sci. & Eng., Nat. Inst. of Technol., Warangal, India
fYear
2009
fDate
23-26 Jan. 2009
Firstpage
1
Lastpage
7
Abstract
The use of clustering as a data analysis tool has raised concerns about the violation of individual privacy. This paper proposes a data perturbation technique for privacy preservation in k-means clustering. Data objects that have been partitioned into clusters using k-means clustering are perturbed by performing geometric transformations on the clusters in such a way that the object membership of each cluster and orientation of objects within a cluster remain the same. This geometric transformation is achieved through cluster rotation, i.e., every cluster is rotated about its own centroid. The clusters are first displaced away from the mean of the entire dataset so that no two clusters overlap after the subsequent cluster rotation. We analyze the privacy measure offered by this data perturbation technique and prove that a dataset perturbed by this method cannot be easily reverse engineered, yet is still relevant for cluster analysis.
Keywords
data analysis; data privacy; pattern clustering; perturbation techniques; reverse engineering; cluster rotation; data analysis; data perturbation; k-means clustering; privacy preservation; reverse engineering; Clustering algorithms; Computer science; Data analysis; Data engineering; Data mining; Data privacy; Partitioning algorithms; Perturbation methods; Reverse engineering; Spatial databases; Clustering; Data Mining; Data Perturbation; Geometric Transformation; Privacy Preservation;
fLanguage
English
Publisher
ieee
Conference_Titel
TENCON 2009 - 2009 IEEE Region 10 Conference
Conference_Location
Singapore
Print_ISBN
978-1-4244-4546-2
Electronic_ISBN
978-1-4244-4547-9
Type
conf
DOI
10.1109/TENCON.2009.5396140
Filename
5396140
Link To Document