Detecting communities in social networks based on cliques

Abstract Social network analysis is an important tool that can be used in many domains. Among the social network analysis algorithms and tools we find the community structure detection. Many community structure detection algorithms have been developed over years, but most of them have a high computational complexity. In this paper we propose a new approach to find a community structure in networks. Our approach is more stable, accurate and effective to find the community structure in networks with high inter-community links. Our method operates in two phases. In the first phase, our method finds all the circuits in order to split the network into small elementary groups. Then (in the second phase)the community structure will be found by merging iteratively the different sub graphs resulting from the first phase by a fusion principle used in clique-based methods. Our method was evaluated on different types of networks. We tested our method on generated-computer and real-world networks. A comparison was held between our method and some known methods of community detection. The results show that our method is very effective in finding communities in networks and saving the time complexity.

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

[2]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

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

[4]  Yu Xue,et al.  A community integration strategy based on an improved modularity density increment for large-scale networks , 2017 .

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

[6]  Yangyang Li,et al.  Large-scale community detection based on node membership grade and sub-communities integration , 2015, Physica A: Statistical Mechanics and its Applications.

[7]  M. Newman,et al.  A network-based ranking system for US college football , 2005, physics/0505169.

[8]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[9]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[10]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[11]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[12]  Huan Liu,et al.  Community mining using three closely joint techniques based on community mutual membership and refinement strategy , 2017, Appl. Soft Comput..

[13]  Massimo Marchiori,et al.  Method to find community structures based on information centrality. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[15]  A. Barabasi,et al.  Quantifying social group evolution , 2007, Nature.

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

[17]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..