Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/1645
Title: | Privacy Preservation in k-Means Clustering by Cluster Rotation |
Authors: | Dhiraj, S. S. Shivaji Asif Khan, Ameer M. Khan, Wajhiulla Challagalla, Ajay |
Keywords: | Data Mining Clustering |
Issue Date: | 2009 |
Publisher: | IEEE Region 10 Annual International Conference, Proceedings/TENCON |
Citation: | 10.1109/TENCON.2009.5396140 |
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. |
Description: | NITW |
URI: | http://localhost:8080/xmlui/handle/123456789/1645 |
Appears in Collections: | Computer Science & Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Privacy_preservation_in_k-means_clustering_by_cluster_rotation.pdf | 480.16 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.