Privacy Preserving In Data Mining: A Survey
DOI:
https://doi.org/10.26438/ijcse/v6i1.146150Keywords:
Data Mining, Privacy preserving Data Mining, ClusteringAbstract
Todays scenario conversion of data from the databases or data warehouse to avail the users is one of the challenging tasks in data mining. There is high risk of data loss and these losses of data sometimes create high risk for users for their sensitive data; because large amount of data gets publish on daily basis. Data mining comes now a day has lots of necessary techniques for privacy preserving. In the past decennary the evolution of various data mining techniques, privacy preservation in data mining becomes an important issues. Basically privacy preservation of data mining provides the facility of sharing of critical data for analysis purposes. The problem of privacy preserving data mining becomes very crucial due to the possibility of occurrence of personal data. Essential parameter used for preserving the privacy of data mining is efficiency, time, cost, accuracy. To achieve the high privacy user have to compromise accuracy, time and cost. This survey paper mainly discussed the introduction of Data Mining, some of the proposed algorithm for privacy preserving in data mining and framework of privacy preservation. Several privacy preservation techniques in data mining based upon different parameters to measure Information Loss Rate (ILR) and Privacy Ratio (PR) are also discussed in this paper.
References
R Natarajan, "A survey on Privacy Preserving Data Mining, "International Journal of Advanced Research in Computer and Communication Engineering Vol.1, Issue.1, pp. 103-112, 2012.
Kalita, M., D. K. Bhattacharyya, and M. Dutta,"Privacy Preserving Clustering-A Hybrid Approach." Advanced Computing and Communications, 2008. ADCOM 2008. 16th International Conference, Chennai, India. IEEE, 2008.
Shikha Sharma & Pooja Jain, “A Novel Data Mining Approach for Information Hiding”, International Journal of Computers and Distributed Systems, Vol.1, Issue 3, October 2012.
Arpit Agrawal,” Security based Efficient Privacy Preserving Data Mining” International Journal of Application or Innovation in Engineering & Management, Vol. 2, Issue 7, pp- 225,July 2013.
Tagaram Soni Madhulatha, "Compa rison between K-Means and K-Medoids Clustering Algorithms", Communications in Computer and Information Science, vol. 198, pp. 472-481, 2011.
Zhang L, Yang M, Lei D. “An improved PAM clustering algorithm based on initial clustering centers” 2012. Applied Mechanics and Materials, Vol.135-136, pp. 244-249, 2012.
A. Susana, Leiva-Valdebenito, J. Francisco, Torres-Aviles, “ A review of the most common partition algorithms in cluster analysis: a comparative study”, Colombian Journal of Statistics , Vol. 33, No. 2, pp.321–339, 2010.
Bhat, A., “K-Medoids Clustering using Partitioning Around Medoids for Performing Face recognition”, Inter -national Journal of Soft Computing, Mathemetics and Control(IJSCMC), Vol. 3, No. 3, pp. 1-12. August 2014.
Md Zahidul Islam, Ljiljana Brankovic “Privacy preserving data mining: A noise addition framework using a novel clustering technique”, Elsevier, Vol. 24, Issue. 8, pp. 1214-1223, 2011 .
Ratna Kendhe, Lahar Mishra, Janhavi Bhalerao,"Privacy Preserving In Data Mining: A Survey", International Journal of Scientific and Research Publications, Vol 5, Issue 10, pp.1-4 , October 2015.
V. Rajalakshmi, ”Anonymization based on nested clustering for privacy preservation in data mining”, Indian Journal of Computer Science and Engineering (IJCSE), Vol. 4 ,No.3 ,Jun-Jul 2013.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
