On the basis of analyzing the modularity and Newman detecting algorithm for network community structure
an algorithm based on prior knowledge and modularity(PKM)is put forward to detect community structure. An original community division is acquired by using the prior knowledge of the structure of social networks
such as the degree of the node
and then the communities are combined so as to get a clarified partition. Through calculation of computer simulation networks
Ucinet networks and Chinese rural-urban migrants social networks
the results indicate that the number of iterations of the proposed algorithm is reduced nearly by 50% compared to that of Newman's
and the higher modularity can be yielded.
关键词
Keywords
references
Newman M E J. Detecting community structure in networks [J]. Eur Phys J:B, 2004,38(2):321-330.
Newman M E J. Fast algorithm for detecting community structure in networks [J]. Phys Rev:E, 2004, 69(6):066133.
罗家德. 社会网分析讲义 [M]. 北京:社会科学文献出版社,2005.
Wasserman S,Faust K. Social network analysis: methods and applications [M]. New York:Cambridge University Press, 1994.
Wang Lin, Dai Guanzhong. Community finding in complex networks — theory and applications [J]. Science Technology Review,2005, 23(8):62-66.
Scott W, Smyth P. A spectral clustering approach to finding communities in graphs[EB/OL].[2006-04-11].http:∥www.datalab. uci.edu/papers/siam_graph_clustering.pdf.
Aaron C, Newman M E J, Moore C. Finding community structure in very large networks [J]. Phys Rev:E,2004,74(3):36104.
Albert R, Barabàsi A L R. Statistical mechanics of complex networks [J]. Reviews of Modern Physics, 2002,74(1):48-97.
Watts D J, Strogatz S H. Collective dynamics of ‘small-world' networks [J]. Nature, 1998, 393(4): 440-442.
Newman M E J, Girvan M. Statistical mechanics of complex networks [M]. Berlin: Springer, 2003.
Dorogovtsev S N, Mendes J F. Scaling properties of scale-free evolving networks: continuous approach [J].Phys Rev:E, 2001,63(5):056125.