Comparisons of randomization and K-degree anonymization schemes for privacy preserving social network publishing

Proceedings of the 3rd Workshop on Social Network Mining and Analysis, SNA-KDD '09

Volumn , Issue , 2009, Pages

  Ying, Xiaowei ^a   Pan, Kai ^a   Wu, Xintao ^a   Guo, Ling ^a  

^a UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE   (United States)

Author keywords

Identity disclosure; Link disclosure; Privacy preserving data mining; Social network randomization

Indexed keywords

ANONYMIZATION; BACKGROUND KNOWLEDGE; EDGE-BASED; EMPIRICAL COMPARISON; PRIVACY PRESERVING; PRIVACY PRESERVING DATA MINING; SOCIAL NETWORKS; USER IDENTITY;

ELECTRONIC PUBLISHING; TECHNICAL PRESENTATIONS;

DATA PRIVACY;

EID: 77951497108     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1731011.1731021     Document Type: Conference Paper

References (31)

1. L. Adamic and N. Glance. The political blogosphere and the 2004 us election: divided they blog. In Proceedings of the WWW-2005 Workshop on the Weblogging Ecosystem, 2005.
2. L. Backstrom, C. Dwork, and J. Kleinberg. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In WWW '07: Proceedings of the 16th international conference on World Wide Web, pages 181-190, New York, NY, USA, 2007. ACM Press.
3. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group formation in large social networks: membership, growth, and evolution. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 44-54, New York, NY, USA, 2006. ACM.
4. J. Baumes, M. K. Goldberg, M. Magdon-Ismail, and W. A. Wallace. Discovering hidden groups in communication networks. In ISI, pages 378-389, 2004.
5. T. Y. Berger-Wolf and J. Saia. A framework for analysis of dynamic social networks. In KDD, pages 523-528, 2006.
6. A. Campan and T. M. Truta. A clustering approach for data and structural anonymity in social networks. In PinKDD, 2008.
7. L. da F. Costa, F. A. Rodrigues, G. Travieso, and P. R. V. Boas. Characterization of complex networks: A survey of measurements. Advances In Physics, 56:167, 2007.
8. A. Fast, D. Jensen, and B. N. Levine. Creating social networks to improve peer-to-peer networking. In KDD, pages 568-573, 2005.
9. M. Girvan and M. E. Newman. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA, 99(12):7821-7826, June 2002.
10. S. Hanhijarvi, G. C. Garriga, and K. Puolamaki. Randomization techniques for graphs. In Proc. of the 9th SIAM Conference on Data Mining, 2009.
11. M. Hay, G. Miklau, D. Jensen, D. Towsely, and P. Weis. Resisting structural re-identification in anonymized social networks. In VLDB, 2008.
12. M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava. Anonymizing social networks. University of Massachusetts Technical Report, 07-19, 2007.
13. D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD, pages 137-146, 2003.
14. J. M. Kleinberg. Challenges in mining social network data: processes, privacy, and paradoxes. In KDD, pages 4-5, 2007.
15. Y. Koren, S. C. North, and C. Volinsky. Measuring and extracting proximity in networks. In KDD, pages 245-255, 2006.
16. V. Krebs. http://www.orgnet.com/. 2006.
17. R. Kumar, J. Novak, and A. Tomkins. Structure and evolution of online social networks. In KDD, pages 611-617, 2006.
18. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM '03: Proceedings of the twelfth international conference on Information and knowledge management, pages 556-559, New York, NY, USA, 2003. ACM.
19. K. Liu and E. Terzi. Towards identity anonymization on graphs. In Proceedings of the ACM SIGMOD Conference, Vancouver, Canada, 2008. ACM Press.
20. A. Seary and W. Richards. Spectral methods for analyzing and visualizing networks: an introduction. National Research Council, Dynamic Social Network Modelling and Analysis: Workshop Summary and Papers, pages 209-228, 2003.
21. J. Shetty and J. Adibi. The Enron email dataset database schema and brief statistical report. Information Sciences Institute Technical Report, University of Southern California, 2004.
22. M. Shiga, I. Takigawa, and H. Mamitsuka. A spectral clustering approach to optimally combining numericalvectors with a modular network. In KDD, pages 647-656, 2007.
23. E. Spertus, M. Sahami, and O. Buyukkokten. Evaluating similarity measures: a large-scale study in the orkut social network. In KDD, pages 678-684, 2005.
24. C. Tantipathananandh, T. Y. Berger-Wolf, and D. Kempe. A framework for community identification in dynamic social networks. In KDD, pages 717-726, 2007.
25. S. White and P. Smyth. Algorithms for estimating relative importance in networks. In KDD, pages 266-275, 2003.
26. X. Ying and X. Wu. Randomizing social networks: a spectrum preserving approach. In Proc. of the 8th SIAM Conference on Data Mining, April 2008.
27. X. Ying and X. Wu. Graph generation with prescribed feature constraints. In Proc. of the 9th SIAM Conference on Data Mining, 2009.
28. X. Ying and X. Wu. On link privacy in randomizing social networks. In PAKDD, 2009.
29. E. Zheleva and L. Getoor. Preserving the privacy of sensitive relationships in graph data. In PinKDD, pages 153-171, 2007.
30. B. Zhou and J. Pei. Preserving Privacy in Social Networks Against Neighborhood Attacks. IEEE 24th International Conference on Data Engineering, pages 506-515, 2008.
31. B. Zhou, J. Pei, and W.-S. Luk. A brief survey on anonymization techniques for privacy preserving publishing of social network data. SIGKDD Explorations, 10(2), 2009.