Algorithm Based on the Vertex Similarity of the Network for Detecting Community Structure

Abstract:

In order to quickly and accurately find the community structure of complex networks ,This article start from the similarity of the node ,Proposed a new community discovery algorithm. Introduced similar values and custom node value Q during the process of algorithm design ,Firstly , To Select the nodes with the largest similarity value by calculating the similarity between nodes ,Then to decide to join and expand the nodes by calculating the Q value is greater than 0 or not. Repeat the above process, you can get the whole network of community structure, The process does not require any auxiliary information or other seed nodes. Applied to the actual network experiment results verify the feasibility of the algorithm.

• Periodical: Advanced Materials Research (Volumes 926-930)
• Pages: 2932-2937
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.926-930.2932
• Online since: May 2014
• Authors: Chi Zhang*, Li Xu, Chang Liu, Chun Long Fan
• Keywords: Community Structure, Complex Network, FN, Q Value

References

[1] Wu F, Huberman B A. Finding communities in linear time: a physics approach [J] European Physical Journal B, 2004, 38 (2) : 331-338.

[2] Newman ME J. Fast algorithm for detecting community structure in networks [J]. Physical Review E, 2004, 69 (6).

[3] Guimera R, Amaral LA N. Functional cartography of complex metabolic networks [J]. Nature, 2005, 433 (7028) : 895-900.

DOI: 10.1038/nature03288

[4] Bagrow JP, Bollt E MA local method for detecting communities [J]. Physical Review E, 2005, 72 (4).

[5] Wang Limin , High School East , etc. detection algorithm based on local community structure close to the maximum node degree [J]. Computer Engineering , 2010, 36 ( 1 ) : 25 -29.

[6] Li hole Wen, Gu Qing, Zhang Yao , etc. based on local community gathered coefficient partitioning algorithm [J]. Computer Science , 2010, 37 ( 7 ) : 46 -53.

[7] Da L, costa F. Hub-based community finding [EB / OL] . 2004-03-20. Http: /arxiv. org/abs/cond-mat/0405022.

[8] Fang Ping , Zhi-Tang Li , and other network nodes proximity algorithm complexity of local communities mining [J]. Computer Engineering and Applications, 2013, 49 ( 17 ) 38-42.

[9] Newman ME J. Modularity and community structure in networks [J]. Proceedings of the National Academy of Sciences of the United States of America, 2006, 103 (23) : 8577-8582.

DOI: 10.1073/pnas.0601602103

[10] Clauset A, Newman MEJ, Moore C. Finding community structure in very large networks [J]. Physical Review E-Statistical, Nonlinear, and Soft Matter Physics, 2004, 70 (62).

DOI: 10.1103/physreve.70.066111