Network Community Detection Based on Co-Neighbor Modularity Matrix with Spectral Clustering

Article Preview

Abstract:

The problem of community detection is one of the outstanding issues in the study of network systems. This paper presents co-neighbor modularity matrix to measure the quality of community detection. The problem of community detection is projected into clustering of eigenvectors in Euclidean space. Network community structure is detected with spectral clustering algorithm which is free from the noise of initial mean point in K-mean algorithm. The experimental results suggest that the method is efficient in finding the structure of community.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1237-1241

Citation:

Online since:

May 2011

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] M. C. González, C. A. Hidalgo ,A. -L. Barabási. Understanding individual human mobility patterns, Nature, 453(2008), 779-782.

DOI: 10.1038/nature06958

Google Scholar

[2] A Vespignani. Predicting the Behavior of Techno-Social Systems. Science, 325(2009): 425 – 428.

DOI: 10.1126/science.1171990

Google Scholar

[3] Damon Centola. The Spread of Behavior in an Online Social Network Experiment, Science, 329, 1194 (2010).

Google Scholar

[4] C. Song, T. Koren, P. Wang,A. -L. Barabási. Modelling the scaling properties of human mobility, Nature Physics, 6 (2010), 818 – 823.

DOI: 10.1038/nphys1760

Google Scholar

[5] M.E.J. Newman, M. Girvan. Finding and evaluating community structure in networks. Phys Rev E, 69(2004): 026113.

Google Scholar

[6] J. Reichardt and S. Bornholdt. Statistical mechanics of community detection , Phys , Rev , E, 74 (2006), 016110.

Google Scholar

[7] A. Arenas, A. Fernandez, S Gomez. Multiple resolution of the modular structure of complex networks. New Journal of physics , 2007, 10(5): 053039.

Google Scholar

[8] A. Capocci ,V.D.P. Servedio ,G. Caldarelli et al . Detecting communities in large networks. In S. Leonardi(ed. ), Proceedings of the 3rd Workshop on algorithms and models for the web graph, number 3243 in Lecture Notes in Computer Science, Springer, Berlin(2004).

DOI: 10.1007/978-3-540-30216-2_15

Google Scholar

[9] C.H. Guo N. Zhang . Partition methods based on common neighbors matrix for the community structure in complex networks, Systems Engineering-theory& practice, 2010, 30(6).

Google Scholar

[10] M.E.J. Newman, Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74(3), (2006), 036104.

Google Scholar

[11] Brendan J. Frey, etal. Clustering by passing message between data points. Science, 315(2007), 972-976.

DOI: 10.1126/science.1136800

Google Scholar