Overlapping Community Detection based On Maximal Clique and Multi-objective Ant Colony Optimization

Community detection is an important technique of complex network, which has great influence in understanding the structure of networks. There are much attention has been paid to detect separated communities, where one node must belong to one community. However, it is more necessary for us to detect the overlapping communities, which often appear in many real-world networks. In this paper, we proposed a multi-objective overlapping community detection algorithm called MCMOCD-ACO, which combing with the multiobjective ant colony optimization(mACO) and clique-based representation scheme. In this algorithm, a new representation scheme based on the introduced maximal-clique graph is presented. Since the maximal clique graph is defined by using a set of maximal cliques of original graph as nodes and two maximal cliques are allowed to share the same nodes of the original graph, overlap is an intrinsic property of the maximal-clique graph. Under this representation scheme, mACO is allowed to handle the separated community in a way similar to that of the separated community detection which can simplified the overlapping community detection optimization problems. The experimental results on synthetic and real networks demonstrate the effective performance of our algorithm over four state-of-the-art overlapping community methods.

[1]  David Lusseau,et al.  The emergent properties of a dolphin social network , 2003, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[2]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[3]  Yilong Yin,et al.  A Maximal Clique Based Multiobjective Evolutionary Algorithm for Overlapping Community Detection , 2017, IEEE Transactions on Evolutionary Computation.

[4]  Maoguo Gong,et al.  Complex Network Clustering by Multiobjective Discrete Particle Swarm Optimization Based on Decomposition , 2014, IEEE Transactions on Evolutionary Computation.

[5]  Guimei Liu,et al.  Complex discovery from weighted PPI networks , 2009, Bioinform..

[6]  Jing Liu,et al.  A link clustering based memetic algorithm for overlapping community detection , 2018, Physica A: Statistical Mechanics and its Applications.

[7]  V. Carchiolo,et al.  Extending the definition of modularity to directed graphs with overlapping communities , 2008, 0801.1647.

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

[9]  S Boccaletti,et al.  Identification of network modules by optimization of ratio association. , 2006, Chaos.

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

[11]  Xu Zhou,et al.  A multiobjective discrete bat algorithm for community detection in dynamic networks , 2018, Applied Intelligence.

[12]  Jing Liu,et al.  A Multiobjective Evolutionary Algorithm Based on Similarity for Community Detection From Signed Social Networks , 2014, IEEE Transactions on Cybernetics.

[13]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Tao You,et al.  Community Detection in Complex Networks Using Density-based Clustering Algorithm , 2015, ArXiv.

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