Detecting an Overlapping Community Structure by Using Clique-to-Clique Similarity based Label Propagation

Many researchers have proven that complex networks have community structures and that most network communities are overlapping. Numerous algorithms have been proposed and used to detect non-overlapping or overlapping communities in networks. Many community-detecting algorithms are based on a clique. A clique is a subset of the nodes in the network in which every pair of nodes has an edge between them. In this paper, we propose a new algorithm that is based on a clique-to-clique similarity measure, and the label propagation to detect overlapping communities. The algorithm first finds all cliques of the network; then, it builds a new network according to a specific strategy, that specifies that in the new network, a node represents a clique found in the last step, and an edge is the link relation generated according to the strategy. The experimental results for both synthetic networks and real-world networks show that the proposed algorithm is not only effective, but also better than other algorithms in forms of the quality of results on the time efficiency.

[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]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[3]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[5]  Haijun Zhou.  Distance, dissimilarity index, and network community structure. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[7]  Zhou Tao,et al.  Detecting Overlapping Communities Based on Community Cores in Complex Networks , 2010 .

[8]  Xiangbin Yan,et al.  Community cores expansion for overlapping community detection in complex networks , 2018, Modern Physics Letters B.

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

[10]  Illés J. Farkas,et al.  CFinder: locating cliques and overlapping modules in biological networks , 2006, Bioinform..

[11]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994 .

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

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

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

[15]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

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

[17]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.

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

[19]  Pietro Liò,et al.  Towards real-time community detection in large networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.