Incognizance of Social Networks by Sequential Clustering

The complexity in preserving privacy of social networks is considered. The distributed setting in which the network data is split between several data holders is focussed. The goal is to arrive at an anonymized view of the unified network in a distributed environment. The leading clustering algorithm for achieving anonymity is SANGreeA (Social Network Greedy Anonymization), which is significantly outperformed by our proposed clustering algorithmic techniques. To the best of our knowledge, this is the first study for privacy preservation in distributed social network.

[1]  Jon M. Kleinberg,et al.  Wherefore art thou R3579X? , 2011, Commun. ACM.

[2]  Chris Clifton,et al.  Thoughts on k-Anonymization , 2006, 22nd International Conference on Data Engineering Workshops (ICDEW'06).

[3]  Alina Campan,et al.  Data and Structural k-Anonymity in Social Networks , 2009, PinKDD.

[4]  Lise Getoor,et al.  Preserving the Privacy of Sensitive Relationships in Graph Data , 2007, PinKDD.

[5]  Tamir Tassa,et al.  Efficient Anonymizations with Enhanced Utility , 2009, 2009 IEEE International Conference on Data Mining Workshops.

[6]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[7]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[8]  Siddharth Srivastava,et al.  Anonymizing Social Networks , 2007 .

[9]  Vijay S. Iyengar,et al.  Transforming data to satisfy privacy constraints , 2002, KDD.

[10]  Donald F. Towsley,et al.  Resisting structural re-identification in anonymized social networks , 2008, The VLDB Journal.