WANG Xiao-fan, LIU Ya-bing. Overview of Algorithms for Detecting Community Structure in Complex Networks[J]. Journal of University of Electronic Science and Technology of China, 2009, 38(5): 537-543. DOI: 10.3969/j.issn.1001-0548.2009.05.007
Citation: WANG Xiao-fan, LIU Ya-bing. Overview of Algorithms for Detecting Community Structure in Complex Networks[J]. Journal of University of Electronic Science and Technology of China, 2009, 38(5): 537-543. DOI: 10.3969/j.issn.1001-0548.2009.05.007

Overview of Algorithms for Detecting Community Structure in Complex Networks

  • Community structure is a very important property of complex networks. Detecting communities in networks is of great importance in biology, computer science, sociology and so on. In recent years, a lot of community discovery algorithms have been proposed aiming at different kinds of large scale complex networks. In this paper, we review some latest representative algorithms, focusing on the improved methods based on the modularity function, the algorithms which can detect overlapping and hierarchical community structure in networks, and the benchmark in detecting communities. Finally, some future directions are pointed out.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return