Random Articles
Reseach Article
SACK: Anonymization of Social Networks by Clustering of K-edge-connected Subgraphs
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 77 - Number 8 |
| Year of Publication: 2013 |
| Authors: Fatemeh Heidari Soureshjani, Arash Ghorbannia Delavar, Fatemeh Rashidi |
10.5120/13412-1067
|
Fatemeh Heidari Soureshjani, Arash Ghorbannia Delavar, Fatemeh Rashidi . SACK: Anonymization of Social Networks by Clustering of K-edge-connected Subgraphs. International Journal of Computer Applications. 77, 8 ( September 2013), 5-11. DOI=10.5120/13412-1067
Abstract
In this paper, a method for anonymization of social networks by clustering of k-edge-connected subgraphs (SACK) is presented. Previous anonymization algorithms do not consider distribution of nodes in social network graph according to their attributes. SACk tries to focus on probability of existence of an edge between two nodes is related to their attributes and this leads to a graph with connected subgraphs. Using connected subgraphs in anonymization process this method obtains better experimental results both in data quality and time. In other word, Sequential clustering is mostly used for anonymization and using k-edge connected subgraphs for starting step. Sequential clustering is a greedy algorithm and results are dependent on starting point.
References
- P. Samarati. Protecting Respondents Identities in Microdata Release. IEEE Transactions on Knowledge and Data Engineering, Vol. 13, No. 6, 1010–1027, 2001.
- L. Sweeney. K-Anonymity: A Model for Protecting Privacy. nternational Journal on Uncertainty, Fuzziness, and Knowledge-based Systems, Vol. 10, No. 5, 557–570, 2002.
- F. Bonchi, A. Gionis, and T. Tassa. Identity obfuscation in graphs through the information theoretic lens. In ICDE, pages 924–935, 2011.
- S. Hanhij¨arvi, G. Garriga, and K. Puolamaki. Randomization techniques for graphs. In SDM, pages 780–791, 2009.
- M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava. Anonymizing social networks. Uni. of Massachusetts Technical Report, 07(19), 2007.
- X. Ying and X. Wu. Randomizing social networks: A spectrum preserving approach. In SDM, pages 739–750, 2008.
- X. Ying and X. Wu. Graph generation with prescribed feature constraints. In SDM, pages 966–977, 2009.
- X. Ying and X. Wu. On link privacy in randomizing social networks. In PAKDD, pages 28–39, 2009.
- A. Campan and T. M. Truta. Data and structural k-anonymity in social networks. In PinKDD, pages 33–54, 2008.
- M. Hay, G. Miklau, D. Jensen, D. F. Towsley, and P. Weis. Resisting structural re-identification in anonymized social networks. In PVLDB, pages 102–114, 2008.
- E. Zheleva and L. Getoor. Preserving the privacy of sensitive relationship in graph data. In PinKDD, pages 153–171, 2007.
- Tamir Tassa, Dror J. Cohen: Anonymization of Centralized and Distributed Social Networks by Sequential Clustering. IEEE Trans. Knowl. Data Eng. 25(2): 311-324, 2013.
- Rui Zhou, Chengfei Liu, Jeffrey Xu Yu: Finding Maximal k-Edge-Connected Subgraphs from a Large Graph. In EDBT '12, Pages 480-491, 2012.
- Freeman L. The Development of Social Network Analysis. Vancouver: Empirical Press, 2006.
- Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A. Anonymizing Tables. ICDT, pp:. 246-258, 2005.
- Bayardo R. J. , Agrawal R. (2005). Data privacy through optimal k-anonymization. In Proc. of the International Conference on Data Engineering (ICDE), Tokyo, Japan, 2005.
- Chawla S, Dwork C, Mcsherry F, Smith A, Wee H. Toward privacy in public databases. In Theory of Cryptography Conference (TCC), 2005
- Ciriani V, Vimercati S, Foresti, S, Samarati P. k-Anonymous data mining:A survey. Book:Privacy-preserving data mining. Springer US, pp: 105–136, 2008.
Index Terms
Keywords