Multi-objective ant colony optimization algorithm based on decomposition for community detection in complex networks

Community detection aims to identify topological structures and discover patterns in complex networks, which presents an important problem of great significance. The problem can be modeled as an NP hard combinatorial optimization problem, to which multi-objective optimization has been applied, addressing the common resolution limitation problem in modularity-based optimization. In the literature, ant colony optimization (ACO) algorithm, however, has been only applied to community detection with single objective. This is due to the main difficulties in defining and updating the pheromone matrices, constructing the transition probability model, and tuning the parameters. To address these issues, a multi-objective ACO algorithm based on decomposition (MOACO/D-Net) is proposed in this paper, minimizing negative ratio association and ratio cut simultaneously in community detection. MOACO/D-Net decomposes the community detection multi-objective optimization problem into several subproblems, and each one corresponds to one ant in the ant colony. Furthermore, the ant colony is partitioned into groups, and ants in the same group share a common pheromone matrix with information learned from high-quality solutions. The pheromone matrix of each group is updated based on updated nondominated solutions in this group. New solutions are constructed by the ants in each group using a proposed transition probability model, and each of them is then improved by an improvement operator based on the definition of strong community. After improvement, all the solutions are compared with the solutions in the external archive and the nondominated ones are added to the external archive. Finally each ant updates its current solution based on a better neighbor, which may belong to an adjacent group. The resulting final external archive consists of nondominated solutions, and each one corresponds to a different partition of the network. Systematic experiments on LFR benchmark networks and eight real-world networks demonstrate the effectiveness and robustness of the proposed algorithm. The ranges of proper values for each parameter are also analyzed, addressing the key issue of parameter tuning in ACO algorithms based on a large number of tests conducted.

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

[2]  Clara Pizzuti,et al.  A Multi-objective Genetic Algorithm for Community Detection in Networks , 2009, 2009 21st IEEE International Conference on Tools with Artificial Intelligence.

[3]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[4]  Dayou Liu,et al.  Ant colony optimization for community detection in large-scale complex networks , 2011, 2011 Seventh International Conference on Natural Computation.

[5]  Santo Fortunato,et al.  Community detection in networks: A user guide , 2016, ArXiv.

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

[7]  Roman Vershynin,et al.  Community detection in sparse networks via Grothendieck’s inequality , 2014, Probability Theory and Related Fields.

[8]  Bin Wu,et al.  A New Genetic Algorithm for Community Detection , 2009, Complex.

[9]  Dayou Liu,et al.  Ant Colony Optimization with a New Random Walk Model for Community Detection in Complex Networks , 2011, Adv. Complex Syst..

[10]  M. Newman.  Communities, modules and large-scale structure in networks , 2011, Nature Physics.

[11]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

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

[13]  Gabriele Eichfelder,et al.  Adaptive Scalarization Methods in Multiobjective Optimization , 2008, Vector Optimization.

[14]  Jian Zhang,et al.  An intelligent ant colony optimization for community detection in complex networks , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[15]  Ying Wang,et al.  Quantitative Function for Community Detection , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

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

[18]  Chang Honghao,et al.  Community detection using Ant Colony Optimization , 2013, 2013 IEEE Congress on Evolutionary Computation.

[19]  Yi Liu,et al.  Memetic algorithm with simulated annealing strategy and tightness greedy optimization for community detection in networks , 2015, Appl. Soft Comput..

[20]  Franccois Delarue,et al.  Rough paths and 1d SDE with a time dependent distributional drift: application to polymers , 2014, 1402.3662.

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

[22]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[23]  Hongfang Zhou,et al.  A graph clustering method for community detection in complex networks , 2017 .

[24]  L. Jiao,et al.  Two-stage algorithm using influence coefficient for detecting the hierarchical, non-overlapping and overlapping community structure , 2014 .

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

[26]  Joshua D. Knowles,et al.  An Evolutionary Approach to Multiobjective Clustering , 2007, IEEE Transactions on Evolutionary Computation.

[27]  Thomas Stützle,et al.  A unified ant colony optimization algorithm for continuous optimization , 2014, Eur. J. Oper. Res..

[28]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[29]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[30]  Qingfu Zhang,et al.  MOEA/D-ACO: A Multiobjective Evolutionary Algorithm Using Decomposition and AntColony , 2013, IEEE Transactions on Cybernetics.

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

[32]  Luonan Chen,et al.  Quantitative function for community detection. , 2008 .

[33]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

[34]  Anderson Y. Zhang,et al.  Minimax Rates of Community Detection in Stochastic Block Models , 2015, ArXiv.

[35]  Maoguo Gong,et al.  Memetic algorithm for community detection in networks. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  Chunnian Liu,et al.  A hybrid method for learning Bayesian networks based on ant colony optimization , 2011, Appl. Soft Comput..

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

[38]  Chung-Kuan Cheng,et al.  Ratio cut partitioning for hierarchical designs , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[40]  Carey E. Priebe,et al.  Community Detection and Classification in Hierarchical Stochastic Blockmodels , 2015, IEEE Transactions on Network Science and Engineering.

[41]  ChenFeng,et al.  Memetic algorithm with simulated annealing strategy and tightness greedy optimization for community detection in networks , 2015 .

[42]  Jean-Charles Delvenne,et al.  The many facets of community detection in complex networks , 2016, Applied Network Science.

[43]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[44]  P. Serafini,et al.  Scalarizing vector optimization problems , 1984 .

[45]  Clara Pizzuti,et al.  GA-Net: A Genetic Algorithm for Community Detection in Social Networks , 2008, PPSN.

[46]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[47]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[48]  E. Polak,et al.  On Multicriteria Optimization , 1976 .

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

[50]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

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

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

[53]  Zuren Feng,et al.  Community detection using Ant Colony Optimization , 2013, IEEE Congress on Evolutionary Computation.

[54]  Qingfu Zhang,et al.  Community detection in networks by using multiobjective evolutionary algorithm with decomposition , 2012 .