Anonymization of attributed social graph using anatomy based clustering

被引:10
作者
Mohapatra, Debasis [1 ]
Patra, Manas Ranjan [2 ]
机构
[1] Parala Maharaja Engn Coll, Dept CSE, Brahmapur 7671003, Odisha, India
[2] Berhampur Univ, Dept Comp Sci, Brahmapur 760007, Odisha, India
关键词
Attributed social graph; Privacy preservation; Anonymization; Anatomy; Clustering; K-ANONYMITY; NETWORKS; PRIVACY; SELECTION; UTILITY;
D O I
10.1007/s11042-019-07745-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A social graph is a common way to publish a social network, but such publication poses privacy risks. In this paper, we use attributed social graph as a graph model to represent the original social network. Therefore, anonymization of descriptive as well as structural data is essential to meet the privacy requirement. Cluster based anonymization is one of the anonymization approaches that provides privacy preservation in social network publication. Though most of the previous work like SaNGreeA (SNG) and Sequential Clustering (SC) employ generalization based clustering, we propose an Anatomy based Clustering (AC) that retains the data originality since it doesn't suppress or generalize any value. Therefore, the proposed approach provides higher utility than the existing approaches. Consequently, the information loss in AC is found to be lower than SNG and SC. We propose a Modified Anatomy based Clustering (MAC) which ensures better preservation of ground-truth community than AC. The algorithms are tested on Attributed Networks (ANs) that are created by the proposed Network Generator algorithm. According to information loss and information gain based community preservation, MAC is found to be the best among the four algorithms i.e., SNG, SC, AC, and MAC.
引用
收藏
页码:25455 / 25486
页数:32
相关论文
共 34 条
  • [1] [Anonymous], 2008, PINKDD
  • [2] Babu KS, 2013, TRANS DATA PRIV, V6, P1
  • [3] Anonymizing social networks: A generalization approach
    Babu, Korra Sathya
    Jena, Sanjay Kumar
    Hota, Jhalaka
    Moharana, Bijayinee
    [J]. COMPUTERS & ELECTRICAL ENGINEERING, 2013, 39 (07) : 1947 - 1961
  • [4] k-Degree anonymity and edge selection: improving data utility in large networks
    Casas-Roma, Jordi
    Herrera-Joancomarti, Jordi
    Torra, Vicenc
    [J]. KNOWLEDGE AND INFORMATION SYSTEMS, 2017, 50 (02) : 447 - 474
  • [5] Chester Sean, 2011, CEUR WORKSHOP P, V789, P107
  • [6] Discovering Homophily in Online Social Networks
    De Salve, Andrea
    Guidi, Barbara
    Ricci, Laura
    Mori, Paolo
    [J]. MOBILE NETWORKS & APPLICATIONS, 2018, 23 (06) : 1715 - 1726
  • [7] A Globally Optimal k-Anonymity Method for the De-Identification of Health Data
    El Emam, Khaled
    Dankar, Fida Kamal
    Issa, Romeo
    Jonker, Elizabeth
    Amyot, Daniel
    Cogo, Elise
    Corriveau, Jean-Pierre
    Walker, Mark
    Chowdhury, Sadrul
    Vaillancourt, Regis
    Roffey, Tyson
    Bottomley, Jim
    [J]. JOURNAL OF THE AMERICAN MEDICAL INFORMATICS ASSOCIATION, 2009, 16 (05) : 670 - 682
  • [8] Fung B. C., 2010, An Introduction To PrivacyPreserving Data Publishing: Concepts and Techniques, V0th
  • [9] Goldberger J, 2010, TRANS DATA PRIV, V3, P149
  • [10] Han Jiawei, 2006, DATA MINING CONCEPTS, P402