Detecting highly overlapping community structure based on Maximal Clique Networks

Most of overlapping community detection algorithms cannot be applied to networks with highly overlapping community such as online social networks where individuals belong to many communities. One important reason is that many algorithms detect communities based on the explicit borders where nodes have more connections inside the communities, however, when the vertices' membership number gets large, the explicit borders between communities will fade away. To overcome this disadvantage, a new algorithm named MCNLPA is proposed by expanding the traditional Label Propagation Algorithm (LPA) based on the Maximal Clique Network for highly overlapping community detection. By finding all maximal cliques in networks and defining reasonable edges between them, the maximal clique network is established. Then the updated rule of classic LPA is modified to apply to the maximal network. Experiments show that MCNLPA has a relatively good performance in highly overlapping community detection and overlapping nodes identification.

[1]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Nagiza F. Samatova,et al.  A scalable, parallel algorithm for maximal clique enumeration , 2009, J. Parallel Distributed Comput..

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

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

[5]  Fergal Reid,et al.  Detecting highly overlapping community structure by greedy clique expansion , 2010, KDD 2010.

[6]  Boleslaw K. Szymanski,et al.  Towards Linear Time Overlapping Community Detection in Social Networks , 2012, PAKDD.

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

[8]  Guandong Xu.  2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2014, Beijing, China, August 17-20, 2014 , 2014 .

[9]  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.

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

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

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

[13]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[14]  Santo Fortunato,et al.  Finding Statistically Significant Communities in Networks , 2010, PloS one.