Anonymizing weighted social network graphs

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 904-907

  Das, Sudipto ^a   Eǧecioǧlu, Ömer ^a   El Abbadi, Amr ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMIZATION; EDGE WEIGHTS; GRAPH-THEORETIC; INFORMATION EXTRACTION; K-NEAREST NEIGHBORS; LINEAR FUNCTIONS; LINEAR PROGRAMMING MODELS; MINIMUM SPANNING TREES; PERSONAL PRIVACY; PROOF OF CONCEPT; RESEARCH AREAS; SHORTEST PATH; SOCIAL GRAPHS; SOCIAL NETWORKS;

FUZZY CONTROL; GRAPH THEORY; LINEARIZATION;

TREES (MATHEMATICS);

EID: 77952764286     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2010.5447915     Document Type: Conference Paper

References (19)

1. M. Girvan and M. E. Newman, "Community structure in social and biological networks." Proc Natl Acad Sci U S A, vol. 99, no. 12, pp. 7821-7826, June 2002.
2. Y.-Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong, "Analysis of topological characteristics of huge online social networking services," in WWW. New York, NY, USA: ACM, 2007, pp. 835-844.
3. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and analysis of online social networks," in IMC, 2007, pp. 29-42.
4. S. Hill, F. Provost, and C. Volinsky, "Network-based marketing: Identifying likely adopters via consumer networks," Statistical Science, vol. 22, no. 2, pp. 256-275, 2006.
5. L. Getoor and C. P. Diehl, "Link mining: a survey," SIGKDD Explor. Newsl., vol. 7, no. 2, pp. 3-12, 2005.
6. L. Backstrom, C. Dwork, and J. Kleinberg, "Wherefore Art Thou R3579X?: Anonymized Social Networks, Hidden Patterns, and Structural Steganography," in WWW, 2007, pp. 181-190.
7. A. Korolova, R. Motwani, S. Nabar, and Y. Xu, "Link Privacy in Social Networks," in ICDE, 2008, pp. 1355-1357.
8. A. Campan and T. M. Truta, "A Clustering Approach for Data and Structural Anonymity in Social Networks," in PinKDD, 2008, pp. 1-10.
9. G. Cormode, D. Srivastava, T. Yu, and Q. Zhang, "Anonymizing bipartite graph data using safe groupings," Proc. VLDB Endow., vol. 1, no. 1, pp. 833-844, 2008.
10. M. Hay, G. Miklau, D. Jensen, D. Towsley, and P. Weis, "Resisting structural re-identification in anonymized social networks," Proc. VLDB Endow., vol. 1, no. 1, pp. 102-114, 2008.
11. L. Liu, J. Wang, J. Liu, and J. Zhang, "Privacy preservation in social networks with sensitive edge weights," in SDM, 2009, pp. 954-965.
12. J. M. Kumpula, J. P. Onnela, J. Saramaki, K. Kaski, and J. Kertesz, "Emergence of communities in weighted networks," Physical Review Letters, vol. 99, pp. 228 701-1-228 701-4, 2007.
13. R. Toivonen, J. M. Kumpula, J. Saramäki, J.-P. Onnela, J. Kertész, and K. Kaski, "The role of edge weights in social networks: modelling structure and dynamics," Noise and Stochastics in Complex Systems and Finance, vol. 6601, no. 1, pp. B1-B8, 2007.
14. D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the spread of influence through a social network," in KDD, 2003, pp. 137-146.
15. J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su, "Arnetminer: extraction and mining of academic social networks," in KDD. New York, NY, USA: ACM, 2008, pp. 990-998.
16. J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proceedings of the American Mathematical Society, vol. 7, no. 1, pp. 48-50, February 1956.
17. E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
18. S. Das, Ömer Eǧecioǧlu, and A. El Abbadi, "Anonymizing Edge-Weighted Social Network Graphs," Computer Science, UC Santa Barbara, Tech. Rep. CS-2009-03, March 2009.
19. "LPSolve 5.5," http://lpsolve.sourceforge.net/5.5/.