A Privacy Preserving Clustering On Alphanumeric Data
DOI:
https://doi.org/10.32628/CI023Keywords:
Privacy, Preserve, Data mining, Clustering, PerturbationAbstract
Huge volume of detailed data is collected and analyzed by applications using data mining, sharing of these data is beneficial to the unauthorized persons. On the other hand, it is an important asset to business organization and government for decision making process. At the same time analyzing such data open threats to privacy if privacy is not preserved properly. Our project aims to reveal the information by protecting sensitive data. We are using three perturbation techniques to preserve the privacy of data. Perturbed dataset does not reveal the original data and also does not change the analysis results. Hence, privacy is preserved.
References
- Liming Li, Qishan Zhang, “A Privacy Preserving Clustering Technique Using Hybrid Data Transformation Method”, IEEE, 2009
- Ali Nan, YucelSayg?n, Erkay Sava, AycaAzg?nHinto Lu, Albert Levi, “Privacy Preserving Clustering on Horizontally Partitioned Data”, IEEE, 2006
- M Kalita, D K Bhattacharyya, M Dutta, “Privacy Preserving Clustering- A Hybrid Approach”, IEEE, 2008
- Fang-Yu Rao, Bharath K. Samanthula, Elisa Bertino, Xun Yi, Dongxi Liu, “Privacy-Preserving and Outsourced Multi-User k-Means Clustering”, IEEE, 2015
- Fan-rang Meng, Bin Liu, Chu-jiao Wang, “Privacy Preserving Clustering over Distributed Data”, IEEE, 2010
- Keng-PeiLin,“Privacy-preserving kernek-means clustering outsourcing with random transformation”, Springer, 2016
- Yu Xin, Zhi-QiangXie, Jing Yang, “The privacy preserving method for dynamic trajectory releasing based on adaptive clustering”, Elsevier, 2016
- Alper Bilge, HuseyinPolat?, “A scalable privacy-preserving recommendation scheme via bisecting k-means clustering”, Elsevier, 2016
- Zhi-QiangGao, Long-Jun Zhang, “DPHKMS: An Efficient Hybrid Clustering Preserving Differential Privacy in Spark”, Springer, 2016
Downloads
Published
Issue
Section
License
Copyright (c) IJSRSET

This work is licensed under a Creative Commons Attribution 4.0 International License.