Overlap Community Detection Based on Node Convergence Degree

Community structure is a common feature in real-world network. Overlap community detection is an important method to analyze topology structure and function of the network. Most algorithms are based on the network structure, without considering the node attributes. In this paper, we propose an overlapping community detection algorithm based on node convergence degree which combines the network topology with the node attributes. In our method, PageRank algorithm is used to get the importance of each node in the global network and utilize the local network (local neighbors) to measure the structure convergence degree. Then, node convergence degree combining node attributes and structure convergence degree is designed. Finally, the overlap communities can be identified by the Spectral Cluster based on node convergence degree. Experiments results demonstrate effectiveness and better performance of our method.

[1]  Steve Gregory,et al.  Finding overlapping communities in networks by label propagation , 2009, ArXiv.

[2]  G. Caldarelli,et al.  Detecting communities in large networks , 2004, cond-mat/0402499.

[3]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Mao-Bin Hu,et al.  Detect overlapping and hierarchical community structure in networks , 2008, ArXiv.

[5]  Fang Wu,et al.  Finding communities in linear time: a physics approach , 2003, ArXiv.

[6]  Hong Cheng,et al.  Graph Clustering Based on Structural/Attribute Similarities , 2009, Proc. VLDB Endow..

[7]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[9]  Emmanuel Viennet,et al.  Community Detection based on Structural and Attribute Similarities , 2012, ICDS 2012.

[10]  Roger Guimerà,et al.  Extracting the hierarchical organization of complex systems , 2007, Proceedings of the National Academy of Sciences.

[11]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.

[12]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[13]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Xiaowei Xu,et al.  SCAN: a structural clustering algorithm for networks , 2007, KDD '07.

[15]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[16]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[17]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[18]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.