Network Community Detection Based on Co-Neighbor Modularity Matrix with Spectral Clustering
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.
J. Liu and L. Li, "Network Community Detection Based on Co-Neighbor Modularity Matrix with Spectral Clustering", Applied Mechanics and Materials, Vols. 55-57, pp. 1237-1241, 2011