An efficient algorithm for overlapping community detection in complex networks

Proceedings of the 2009 WRI Global Congress on Intelligent Systems, GCIS 2009

Volumn 1, Issue , 2009, Pages 244-247

  Duanbing, Chen ^a   Yan, Fu ^a   Mingsheng, Shang ^a  

^a UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNITY STRUCTURES; COMPLEX NETWORKS; EFFICIENT ALGORITHM; NETWORK PROPERTIES; NETWORK STRUCTURES; OVERLAPPING COMMUNITIES; REAL-WORLD NETWORKS;

INTELLIGENT SYSTEMS; MINING; SOCIAL SCIENCES;

ALGORITHMS;

EID: 70449336113     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GCIS.2009.68     Document Type: Conference Paper

References (15)

1. M.E.J. Newman, "The structure and function of complex networks", SIAM Rev. Vol. 45, No. 2, SIAM press, Philadelphia, May 2003, pp. 167-256.
2. R. Albert and A.L. Barabasi, "Statistical mechanics of complex networks", Rev. Mod. Phys. Vol. 74, No. 1, APS, Minneapolis, Jan. 2002, pp. 47-97.
3. S.H. Strogatz, "Exploring complex networks", Nature, Vol. 410, Nature Publishing Group, London, Mar. 2001, pp. 268-276.
4. S.N. Dorogovtsev, and J.F.F. Mendes, "Evolution of networks: from biological nets to the internet and WWW", Oxford University Press, Oxford, 2003.
5. M. Fiedler, "Algebraic connectivity of graphs", Czech Math. J. Vol. 23, No. 2, Institute of Mathematics, AS CR, Praha, May 1973, pp. 298-305.
6. B.W. Kernighan, and S. Lin, "An efficient heuristic procedure for partitioning graphs", Bell. Syst. Tech. J. Vol. 49, No. 1, AT&T Bell Lab, New Zeland, Feb. 1970, pp. 291-307.
7. J. Ruan, and W. Zhang, "Identifying network communities with a high resolution", Phys. Rev. E, Vol. 77, APS, Minneapolis, Jan. 2008, 016104.
8. A. Clauset, M.E.J. Newman, and C. Moore, Finding community structure in very large networks, Phys. Rev. E, Vol. 70, APS, Minneapolis, Dec. 2004, 066111.
9. M.E.J. Newman, "Fast algorithm for detecting community structure in networks", Phys. Rev. E, Vol. 69, APS, Minneapolis, Jun. 2004, 066133.
10. M.E.J. Newman, and M. Girvan, "Finding and evaluating community structure in networks", Phys. Rev. E, Vol. 69, APS, Minneapolis, Feb. 2004, 026113.
11. M.E.J. Newman, "Finding community structure in networks using the eigenvectors of matrices", Phy. Rev. E, Vol. 74, APS, Minneapolis, Sep. 2006, 036104.
12. J. Duch, and A. Arenas, "Community detection in complex networks using extremal optimization", Phys. Rev. E, Vol. 72, APS, Minneapolis, Aug. 2005, 027104.
13. X. Wang, G. Chen, and H. Lu, "A very fast algorithm for detecting community structures in complex networks", Phys. A, Vol, 384, No. 2, Elsevier press, Oct. 2007, pp. 667-674.
14. W. W. Zachary, "An information flow model for conflict and fission in small groups", J. Anth. Res. Vol. 33, No. 4, University of New Mexico, New Mexico, Winter 1977, pp. 452-473.
15. D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson, "The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations", Behav. Ecol. Sociobiol. Vol. 54, No. 4, Springer-Verlag, USA, pp. 396-405, 2003.