Anonymization Technique For Privacy Preservation In Social Networks

被引:2
作者
Chavhan, Kalpana [1 ]
Challagidad, Praveen S. [1 ]
机构
[1] Basaveshwar Engn Coll, Comp Sci & Engn, Bagalkot, India
来源
2021 5TH INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS, COMMUNICATION, COMPUTER TECHNOLOGIES AND OPTIMIZATION TECHNIQUES (ICEECCOT) | 2021年
关键词
k-anonymity; clustering; Centroid selection; privacy protection; ANONYMITY;
D O I
10.1109/ICEECCOT52851.2021.9708007
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Anonymization is a valuable privacy protection strategy utilized to protect highly sensitive data from third-party access in a variety of technology fields, including data mining, cloud storage and big data. Data protection against all threats is becoming increasingly important as the importance and quantity of data in today's world grows. The primary goal of this study is to present concise review of data anonymization and differential privacy approaches. In order to address problem of privacy protection, a new k-anonymous solution has been proposed which differs from the traditional k-anonymous solution. In this paper, new algorithm for attaining k-anonymity by more effective clustering is proposed. The majority of clustering algorithms need more computation to process data; however, if the detected initial centers that are consistent with the data setup, then it will obtain a better cluster array. Our research proposes a Dissimilarity Tree-based method for identifying a better initial centroid and a somewhat more accurate cluster with less computation time, as well as NCP. According to graphical findings, the anonymised dataset's total information loss is about 20% lower on average than that of other approaches. It's also capable of handling categorical and numerical characteristics.
引用
收藏
页码:131 / 136
页数:6
相关论文
共 16 条
[1]   How to De-Identify Your Data [J].
Angiuli, Olivia ;
Blitzstein, Joe ;
Waldo, Jim .
COMMUNICATIONS OF THE ACM, 2015, 58 (12) :48-55
[2]  
Ciriani V., 2007, SECURE DATA MANAGEME
[3]  
Dankar FK., 2012, P 2012 JOINT EDBT IC, P158, DOI DOI 10.1145/2320765.2320816
[4]   Privacy, Anonymity, and Big Data in the Social Sciences [J].
Daries, Jon P. ;
Reich, Justin ;
Waldo, Jim ;
Young, Elise M. ;
Whittinghill, Jonathan ;
Ho, Andrew Dean ;
Seaton, Daniel Thomas ;
Chuang, Isaac .
COMMUNICATIONS OF THE ACM, 2014, 57 (09) :56-63
[5]  
Devi Swagatika, 2011, K ANONYMITY HIST IDE, V2
[6]  
Feng Bo, 2012, IMPROVED PAM ALGORIT
[7]  
Friedman A., 2010, P 16 ACM SIGKDD INT, P493, DOI 10.1145/1835804.1835868
[8]   Anonymous Publication of Sensitive Transactional Data [J].
Ghinita, Gabriel ;
Kalnis, Panos ;
Tao, Yufei .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2011, 23 (02) :161-174
[9]   On the anonymization of sparse high-dimensional data [J].
Ghinita, Gabriel ;
Tao, Yufei ;
Kalnis, Panos .
2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2008, :715-+
[10]  
Li N., 2011, Provably private data anonymization: Or, k-anonymity meets differential privacy