Detecting communities in networks by Merging Cliques

Proceedings - 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems, ICIS 2009

Volumn 1, Issue , 2009, Pages 832-836

  Yan, Bowen ^a   Gregory, Steve ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Community structure; Data mining; Network analysis

Indexed keywords

APPROXIMATE ALGORITHMS; COMMUNITY STRUCTURES; CONNECTED SUBGRAPHS; EXECUTION SPEED; IN-NETWORK; MINING NETWORK;

ALGORITHMS; DATA HANDLING; ELECTRIC NETWORK ANALYSIS; INTELLIGENT SYSTEMS; OPTIMIZATION; SOCIAL SCIENCES;

INTELLIGENT COMPUTING;

EID: 77949732953     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICICISYS.2009.5358036     Document Type: Conference Paper

References (30)

1. B. Adamcsek, G. Palla, I. Farkas, I. Derényi, and T. Vicsek, "CFinder: locating cliques and overlapping modules in biological networks," Bioinformatics vol. 22, pp. 1021-1023, 2006.
2. R.D. Alba, "A graph-theoretic definition of a sociometric clique," J. Math. Sociol. vol. 3, pp. 113-126, 1973.
3. V. Batagelj and A. Mrvar, "Some analyses of Erdös collaboration graph," Social Networks vol. 22, pp. 173-186, 2000.
4. M. Boguña, R. Pastor-Satorras, A. Diaz-Guilera, and A. Arenas, "Models of social networks based on social distance attachment," Phys. Rev. E vol. 70, 056122, 2004.
5. C. Bron and J. Kerbosch, "Finding all cliques of an undirected graph," Commun. ACM vol. 16, pp. 575-577, 1973.
6. A. Clauset, M.E.J. Newman, and C. Moore, "Finding community structure in very large networks," Phys. Rev. E vol. 70, 066111, 2004.
7. H. Du, M.W. Feldman, S. Li, and X. Jin, "An algorithm for detecting community structure of social networks based on prior knowledge and modularity," Complexity vol. 12, no. 2, pp. 53-60, 2007.
8. N. Du, B. Wu, X. Pei, B. Wang, and L.T. Xu, "Community detection in large-scale social networks," WebKDD/SNA-KDD Workshop'07, pp. 16-25, 2007.
9. S. Fortunato, "Community detection in graphs," Eprint arXiv:0906.0612v1 at arxiv.org, 2009.
10. M. Girvan and M.E.J. Newman, "Community structure in social and biological networks," Proc. Natl. Acad. Sci. USA vol. 99, pp. 7821-7826, 2002.
11. R. Guimera, L. Danon, A. Diaz-Guilera, F. Giralt, and A. Arenas, "Selfsimilar community structure in a network of human interactions," Phys. Rev. E vol. 68, 065103(R), 2003.
12. L. Hubert and P. Arabie, "Comparing partitions," J. Classif. vol. 2, pp. 193-218, 1985.
13. H. Jeong, B. Tombor, R. Albert, Z. Oltvai, and A.-L. Barabási, "The large-scale organization of metabolic networks," Nature vol. 407, pp. 651-654, 2000.
14. J. Konc and D. Janežič, "An improved branch and bound algorithm for the maximum clique problem," MATCH Commun. Math. Comput. Chem. vol. 58, pp. 569-590, 2007.
15. A. Lancichinetti, S. Fortunato, and F. Radicchi, "Benchmark graphs for testing community detection algorithms," Phys. Rev. E vol. 78, 046110, 2008.
16. C. Lee, "Detecting highly-overlapping community structure," unpublished, 2009.
17. M.E.J. Newman, "The structure of scientific collaboration networks," P. Natl. Acad. Sci. USA vol. 98, pp. 404-409, 2001.
18. M.E.J. Newman, "Fast algorithm for detecting community structure in networks," Phys. Rev. E vol. 69, 066133, 2004.
19. M.E.J. Newman, "Finding community structure in networks using the eigenvectors of matrices," Phys. Rev. E vol. 74, 036104, 2006.
20. M.E.J Newman and M. Girvan, "Finding and evaluating community structure in networks," Phys. Rev. E vol. 69, 026113, 2004.
21. V. Nicosia, G. Mangioni, V. Carchiolo, and M. Malgeri, "Extending the definition of modularity to directed graphs with overlapping communities," J. Stat. Mech. P03024, 2009.
22. P. Östergård, "A fast algorithm for the maximum clique problem," Discrete Applied Mathematics 120, pp. 197-207, 2002.
23. Pajek, Network from Pajek datasets. http://vlado.fmf.uni-lj.si/pub/ networks/data/
24. G. Palla, I. Derényi, I. Farkas, and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society," Nature vol. 435, pp. 814-818, 2005.
25. P. Pons and M. Latapy, "Computing communities in large networks using random walks," J. Graph Algorithms and Applications vol. 10, no. 2, pp. 191-218, 2006.
26. J.M. Pujol, J. Béjar, and J. Delgado, "Clustering algorithm for determining community structure in large networks," Phys. Rev. E vol. 74, 016107, 2006.
27. K. Wakita and T. Tsurumi, "Finding community structure in a megascale social networking service," Proc. IADIS International Conference on WWW/Internet 2007, pp. 153-162, 2007.
28. L. Wan, B. Wu, N. Du, Q. Ye, and P. Chen, "A new algorithm for enumerating all maximal cliques in complex network," ADMA 2006, LNAI 4093, Springer-Verlag, 2006.
29. N. Xie, "Social network analysis of blogs," unpublished, 2006.
30. W.W. Zachary, "An information flow model for conflict and fission in small groups," J. Anthropol. Res. vol. 33, pp. 452-473, 1977.