Community detection in large-scale social networks

Joint Ninth WebKDD and First SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis

Volumn , Issue , 2007, Pages 16-25

  Du, Nan ^a   Wu, Bin ^a   Pei, Xin ^a   Wang, Bai ^a   Xu, Liutong ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Community detection; Graph based data mining; Social network analysis

Indexed keywords

COMPUTATIONAL METHODS; DATA MINING; GRAPH THEORY; MESSAGE PASSING; MULTIMEDIA SERVICES;

INSTANT MESSAGING SYSTEMS; LARGE-SCALE SOCIAL NETWORKS;

LARGE SCALE SYSTEMS;

EID: 43749091772     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1348549.1348552     Document Type: Conference Paper

References (29)

1. J. Abello, M. Resende, and S. Sudarsky. Massive quasi-clique detection. In 5th Latin American Symposium on Theoretical Informatics, pages 598-612, 2002.
2. C. Bron and J. Kerbosch. Finding all cliques of an undirected graph. Communications of the ACM, 16:575-577, 1973.
3. O. V. Burton. Computing in the Social Sciences and Humanities. University of Illinois Press, 2006.
4. A. Clauset, M. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70(066111), 2004.
5. A. Clauset, M. Newman, and C. Moore. Finding local community structure in networks. Physical Review E, 72(026132), 2004.
6. L. Donetti and M. Miguel. Detecting network communities: a new systematic and efficient algorithm. Journal of Statistical Mechanics, pages 100-102, 2004.
7. N. Du, B. Wu, and B. Wang. A parallel algorithm for enumerating all maximal cliques in complex networks. In The 6th ICDM2006 Mining Complex Data Workshop, pages 320-324. IEEE CS, December 2006.
8. J. Duch and A. Arenas. Community detection in complex networks using extremal optimization. Physical Review E, 72(027104), August 2005.
9. M. Girvan and M. Newman. Community structure in social and biological networks. PNAS, 99(12):7821-7826, June 2002.
10. M. Girvan and M. Newman. Finding and evaluating community structure in networks. Physical Review E, 69(026113), 2004.
11. I. Gunes and H. Bingol. Community detection in complex networks using agents. In AAMAS2007, 2007.
12. J. Han and M. Kamber. Data Mining: Concepts and Techniques, 2nd ed. Morgan Kaufmann Publishers, 2006.
13. R. Milo and S. Itzkovitz. Network motifs: Simple building blocks of complex networks. Science, 298:824-827, 2002.
14. M. Newman. Detecting community structure in networks. The European Physical Journal B-Condensed Matter, 38:321-330, 2004.
15. M. Newman. Modularity and community structure in networks. PNAS, 103(23):8577-8582, June 2006.
16. G. Palla, I. Dernyi, and I. Farkas. Uncovering the overlapping community structure of complex network in nature and society. Nature, 435:814-818, June 2005.
17. J. Pei, D. Jiang, and A. Zhang. On mining cross-graph quasi-cliques. In The 12th ACM SIGKDD, pages 228-237, 2006.
18. P. Pons and M. Latapy. Computing communities in large networks using random walks. In ISCIS2005, pages 284-293, 2005.
19. F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi. Defining and identifying communities in networks. PNAS, 101(9):2658-2663, March 2004.
20. M. Rosvall and C. T. Bergstrom. An information-theoretic framework for resolving community structure in complex networks. PNAS, 104(18):7327-7331, May 2007.
21. J. Scott. Social Network Analysis: A Handbook. Sage Publications, London, 2002.
22. C. Song, M. Havlin, and H. Makse. A self-similarity of complex networks. Nature, 433(7024):392-395, 2005.
23. A. Vĺćzquez, R. Dobrin, S. Sergi, J. Eckmann, Z. Oltvai, and A. Barabĺćsi. The topological relationship between the large-scale attributes and local interaction patterns of complex networks. PNAS, 101(52):17940-17945, 2004.
24. S. Wasserman and K. Faust. Social Network Analysis. Cambridge University Press, Cambridge, 1994.
25. B. Wu and X. Pei. A parallel algorithm for enumerating all the maximal k-plexes. In PAKDD07 Workshops, May 2007.
26. Z. Zeng, J. Wang, and G. Karypis. Coherent closed quasi-clique discovery from large dense graph databases. In The 12th ACM SIGKDD, pages 797-802, 2006.
27. http://www-personal.umich.edu/~mejn/
28. http://vlado.fmf.uni-lj.si/pub/networks/pajek/data/gphs.htm
29. V. Batagelj and A. Mrvar. Some Analyses of Erdos Collaboration Graph, http://vlado.fmf.uni-lj.si/pub/networks/doc/erdos/erdos.pdf