CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

SACK: Anonymization of Social Networks by Clustering of K-edge-connected Subgraphs

by Fatemeh Heidari Soureshjani, Arash Ghorbannia Delavar, Fatemeh Rashidi
journal cover thumbnail

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

@article{ 10.5120/13412-1067,
author = { Fatemeh Heidari Soureshjani, Arash Ghorbannia Delavar, Fatemeh Rashidi },
title = { SACK: Anonymization of Social Networks by Clustering of K-edge-connected Subgraphs },
journal = { International Journal of Computer Applications },
issue_date = { September 2013 },
volume = { 77 },
number = { 8 },
month = { September },
year = { 2013 },
issn = { 0975-8887 },
pages = { 5-11 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume77/number8/13412-1067/ },
doi = { 10.5120/13412-1067 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:49:42.525725+05:30
%A Fatemeh Heidari Soureshjani
%A Arash Ghorbannia Delavar
%A Fatemeh Rashidi
%T SACK: Anonymization of Social Networks by Clustering of K-edge-connected Subgraphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 77
%N 8
%P 5-11
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
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
  1. P. Samarati. Protecting Respondents Identities in Microdata Release. IEEE Transactions on Knowledge and Data Engineering, Vol. 13, No. 6, 1010–1027, 2001.
  2. 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.
  3. F. Bonchi, A. Gionis, and T. Tassa. Identity obfuscation in graphs through the information theoretic lens. In ICDE, pages 924–935, 2011.
  4. S. Hanhij¨arvi, G. Garriga, and K. Puolamaki. Randomization techniques for graphs. In SDM, pages 780–791, 2009.
  5. M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava. Anonymizing social networks. Uni. of Massachusetts Technical Report, 07(19), 2007.
  6. X. Ying and X. Wu. Randomizing social networks: A spectrum preserving approach. In SDM, pages 739–750, 2008.
  7. X. Ying and X. Wu. Graph generation with prescribed feature constraints. In SDM, pages 966–977, 2009.
  8. X. Ying and X. Wu. On link privacy in randomizing social networks. In PAKDD, pages 28–39, 2009.
  9. A. Campan and T. M. Truta. Data and structural k-anonymity in social networks. In PinKDD, pages 33–54, 2008.
  10. 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.
  11. E. Zheleva and L. Getoor. Preserving the privacy of sensitive relationship in graph data. In PinKDD, pages 153–171, 2007.
  12. 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.
  13. Rui Zhou, Chengfei Liu, Jeffrey Xu Yu: Finding Maximal k-Edge-Connected Subgraphs from a Large Graph. In EDBT '12, Pages 480-491, 2012.
  14. Freeman L. The Development of Social Network Analysis. Vancouver: Empirical Press, 2006.
  15. Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A. Anonymizing Tables. ICDT, pp:. 246-258, 2005.
  16. 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.
  17. Chawla S, Dwork C, Mcsherry F, Smith A, Wee H. Toward privacy in public databases. In Theory of Cryptography Conference (TCC), 2005
  18. 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

Computer Science
Information Sciences

Keywords

K-Anonymity Social Networks Privacy Clustering Information loss.

Powered by PhDFocusTM