Comparisons of randomization and K-degree anonymization schemes for privacy preserving social network publishing
暂无分享,去创建一个
Xiaowei Ying | Xintao Wu | Kai Pan | Ling Guo | Xintao Wu | Ling Guo | Xiaowei Ying | Kai Pan
[1] Mehran Sahami,et al. Evaluating similarity measures: a large-scale study in the orkut social network , 2005, KDD '05.
[2] L. da F. Costa,et al. Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.
[3] Yehuda Koren,et al. Measuring and extracting proximity in networks , 2006, KDD '06.
[4] M E J Newman,et al. Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.
[5] Jon M. Kleinberg,et al. Challenges in mining social network data: processes, privacy, and paradoxes , 2007, KDD '07.
[6] Gemma C. Garriga,et al. Randomization Techniques for Graphs , 2009, SDM.
[7] David D. Jensen,et al. Creating social networks to improve peer-to-peer networking , 2005, KDD '05.
[8] Jian Pei,et al. A brief survey on anonymization techniques for privacy preserving publishing of social network data , 2008, SKDD.
[9] Ichigaku Takigawa,et al. A spectral clustering approach to optimally combining numericalvectors with a modular network , 2007, KDD '07.
[10] Ravi Kumar,et al. Structure and evolution of online social networks , 2006, KDD '06.
[11] Lise Getoor,et al. Preserving the Privacy of Sensitive Relationships in Graph Data , 2007, PinKDD.
[12] Xiaowei Ying,et al. Graph Generation with Prescribed Feature Constraints , 2009, SDM.
[13] Padhraic Smyth,et al. Algorithms for estimating relative importance in networks , 2003, KDD '03.
[14] Alina Campan,et al. A Clustering Approach for Data and Structural Anonymity in Social Networks , 2008 .
[15] Jian Pei,et al. Preserving Privacy in Social Networks Against Neighborhood Attacks , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[16] K. Liu,et al. Towards identity anonymization on graphs , 2008, SIGMOD Conference.
[17] Tanya Y. Berger-Wolf,et al. A framework for community identification in dynamic social networks , 2007, KDD '07.
[18] Xiaowei Ying,et al. Randomizing Social Networks: a Spectrum Preserving Approach , 2008, SDM.
[19] Siddharth Srivastava,et al. Anonymizing Social Networks , 2007 .
[20] Jafar Adibi,et al. The Enron Email Dataset Database Schema and Brief Statistical Report , 2004 .
[21] Lada A. Adamic,et al. The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.
[22] Donald F. Towsley,et al. Resisting structural re-identification in anonymized social networks , 2010, The VLDB Journal.
[23] A. Seary,et al. Spectral methods for analyzing and visualizing networks : an introduction , 2000 .
[24] Jon M. Kleinberg,et al. Wherefore art thou R3579X? , 2011, Commun. ACM.
[25] Tanya Y. Berger-Wolf,et al. A framework for analysis of dynamic social networks , 2006, KDD '06.
[26] David Liben-Nowell,et al. The link-prediction problem for social networks , 2007 .
[27] Xiaowei Ying,et al. On link privacy in randomizing social networks , 2010, Knowledge and Information Systems.
[28] Malik Magdon-Ismail,et al. Discovering Hidden Groups in Communication Networks , 2004, ISI.
[29] Jon M. Kleinberg,et al. Group formation in large social networks: membership, growth, and evolution , 2006, KDD '06.