A new genetic algorithm for community detection using matrix representation method

Abstract Community structures contain important information of social networks. In most applications, mining community structures would be helpful for people to analyze networks. Typically, genetic algorithm is an effective approach to detect communities. At present, there are two kinds of genetic encoding methods: SGR (Tasgin et al., 2008) and LAR (Pizzuti, 2008) and both have some shortages, which always lead to premature convergence. Based on this, we proposed a new matrix encoding method for community detection, which contains total information of community clustering. We also designed crossover and mutation operator. According to the experiments, our method performed effectively.

[1]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[3]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

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

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

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

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

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

[9]  Ali Daud,et al.  CC-GA: A clustering coefficient based genetic algorithm for detecting communities in social networks , 2018, Appl. Soft Comput..

[10]  M. A. Muñoz,et al.  Journal of Statistical Mechanics: An IOP and SISSA journal Theory and Experiment Detecting network communities: a new systematic and efficient algorithm , 2004 .

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

[12]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[13]  Ronghua Shang,et al.  Community detection based on modularity and an improved genetic algorithm , 2013 .

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

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

[16]  Kun Deng,et al.  Community Detection in Complex Networks based on Improved Genetic Algorithm and Local Optimization , 2016 .

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

[18]  Curt Jones,et al.  Finding Good Approximate Vertex and Edge Partitions is NP-Hard , 1992, Inf. Process. Lett..

[19]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[21]  Amedeo Caflisch,et al.  Multistep greedy algorithm identifies community structure in real-world and computer-generated networks , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Haifeng Du,et al.  A genetic algorithm with local search strategy for improved detection of community structure , 2010 .

[23]  Ronghua Shang,et al.  A multiobjective evolutionary algorithm to find community structures based on affinity propagation , 2016 .