Social Community Classification Based on Laplacian Spectrum Feature

Article Preview

Abstract:

Community structure is a common property that exists in social networks. Community structure analysis is important for understanding network structure and analyzing the network characteristics. Recently community detecting methods are reported continually, but within community the structure is still complex. This paper proposed a method applied to classify community by using Laplacian spectrum feature, and defined the distance measure between the features extracted from difference community. As experiments, this paper studied three complex network models: the random graph of Erdös-Rényi, the small world of Watts and Strogatz and the scale-free graph, and classified them based on Laplacian spectrum feature successfully. The result shows the Laplacian spectrum feature and similarity measure are effective for classification.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

142-146

Citation:

Online since:

June 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] XIE Zhou, WANG Xiao-fan: An Overview of Algorithms for Analyzing Community Structure in Complex Networks, Complex Systems and Complexity Science, Vol. 2 No. 3(2005), pp.1-12.

Google Scholar

[2] Newman M E J: The structure and function of complex networks. SIAM Review (2003), 45: pp.167-256.

Google Scholar

[3] Fiedler, M.: Algebraic connectivity of graphs, Czechoslovak Mathematical Journal 23 (1973), pp.298-305.

DOI: 10.21136/cmj.1973.101168

Google Scholar

[4] Farkas I J, Dereny I, Barabasi A L, et al: Spectra of Real-World, Graphs, Beyond the Semicircle Law. Physical Review E(2001), 64(2): 026704.

Google Scholar

[5] Jamakovic A, Mieghem P V: The Laplacian Spectrum of Complex Networks. (2010) http: /www. nas. ewi. tudelft. nl/people/Almerima/p.42. pdf.

Google Scholar

[6] Janson S, Knuth D E, Luczak T and Pittel B: The birth of the giant component, Random Structures & Algorithms 4(1993), pp.233-358.

DOI: 10.1002/rsa.3240040303

Google Scholar