Remodeling: improved privacy preserving data mining (PPDM)

被引:3
作者
Shastri M.D. [1 ]
Pandit A.A. [1 ]
机构
[1] Department of Master in Computer Applications, Veermata Jijabai Technological Institute Mumbai, Mumbai
关键词
Anonymization; Clustering; Data mining; Encryption; Privacy preserving; Remodeling;
D O I
10.1007/s41870-020-00531-8
中图分类号
学科分类号
摘要
The data provided by individuals and various organizations while using internet applications and mobile devices are very useful to generate solutions and create new opportunities. The data which is shared needs to be precise to get the quality results. The data which may contain an individual’s sensitive information cannot be revealed to the world without applying some privacy preserving technique on it. Privacy preserving data mining (PPDM) and Privacy preserving data publishing (PPDP) are some of the techniques which can be utilized to preserve privacy. There are some positives and negatives for every technique. The cons frequently constitute loss of data, reduction in the utility of data, compromised diversity of data, reduced security, etc. In this paper, the authors propose a new technique called Remodeling, which works in conjunction with the k-anonymity and K-means algorithm to ensure minimum data loss, better privacy preservation while maintaining the diversity of data. Network data security is also handled by this proposed model. In this research paper, theoretically, we have shown that the proposed technique addresses all the above-mentioned cons and also discusses the merits and demerits of the same. © 2020, Bharati Vidyapeeth's Institute of Computer Applications and Management.
引用
收藏
页码:131 / 137
页数:6
相关论文
共 22 条
[1]  
Canbay P., Sever H., The Effect of clustering on data privacy, IEEE 14Th International Conference on Machine Learning and Applications, (2015)
[2]  
Gkoulalas-Divanis A., Loukides G., Sun J., Publishing data from electronic health records while preserving privacy: a survey of algorithms, J Biomed Inform, 50, pp. 4-19, (2014)
[3]  
Aggarwal C.C., Philip S.Y., A general survey of privacy-preservingdataminingmodelsandalgorithms, Privacy-Preservingdatamining, (2008)
[4]  
Huang Z., Du W., Chen B., Deriving private information from randomized data, Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 37-48, (2005)
[5]  
He X., Chen H., Chen Y., Dong Y., Wang P., Huang Z., Clustering-based k-anonymity, In Advances in Knowledge Discovery and Data Mining, Springer, pp. 405-417, (2012)
[6]  
Saranya K., Premalatha K., Rajasekar S.S., A survey on privacy preserving data mining, IEEE Sponsored 2Nd International Conference on Electronics and Communication System, (2015)
[7]  
Li X., Yan Z., Zhang P., A Review on Privacy-Preserving Data Mining, (2014)
[8]  
Dhanalakshmi M., Siva Sankari E., Privacy preserving data mining techniques-survey, IEEE International Conference on Informationcommunicationandembeddedsystems(Icices), (2014)
[9]  
Pingshui W.A.N.G., Survey on privacy preserving data mining, Int J Digital Content Technol Appl, 4, 9, (2010)
[10]  
Agrawal R., Srikant R., Privacy-preserving data mining, ACM Sigmod Record, 29, pp. 439-450, (2000)