Community Detection in Complex Networks: A Novel Approach Based on Ant Lion Optimizer

The problem of community detection in complex networks has established an increased amount of interest since the past decade. Community detection is a way to discover the structure of network by assembling the nodes into communities. The grouping performed for the communities encompasses denser interconnection between the nodes than community’s intra-connections. In this paper a novel nature-inspired algorithmic approach based on Ant Lion Optimizer for efficiently discovering the communities in large networks is proposed. The proposed algorithm optimizes modularity function and is able to recognize densely linked clusters of nodes having sparse interconnects. The work is tested on Zachary’s Karate Club, Bottlenose Dolphins, Books about US politics and American college football network benchmarks and results are compared with the Ant Colony Optimization (ACO) and Enhanced Firefly algorithm (EFF) approaches. The proposed approach outperforms EFF and ACO for Zachary and Books about US politics and produces results better than ACO for Dolphins and EFF for American Football Club. The conclusion drawn from experimental results illustrates the potential of the methodology to effectively identify the network structure.

[1]  Emilio Ferrara,et al.  Topological Features of Online Social Networks , 2011, ArXiv.

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

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

[4]  Aboul Ella Hassanien,et al.  Networks Community Detection Using Artificial Bee Colony Swarm Optimization , 2014, IBICA.

[5]  M. Markus,et al.  Fluctuation theorem for a deterministic one-particle system. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[7]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[9]  Jie Liu,et al.  Multi-level learning based memetic algorithm for community detection , 2014, Appl. Soft Comput..

[10]  M Cieplak 蛋白質の折りたたみにおける協調性と接触秩序 | 文献情報 | J-GLOBAL 科学技術総合リンクセンター , 2004 .

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

[12]  Amedeo Caflisch,et al.  Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

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

[15]  Clara Pizzuti,et al.  A Multiobjective Genetic Algorithm to Find Communities in Complex Networks , 2012, IEEE Transactions on Evolutionary Computation.

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

[17]  Seyed Mohammad Mirjalili,et al.  The Ant Lion Optimizer , 2015, Adv. Eng. Softw..

[18]  Chris Hankin,et al.  Fast Multi-Scale Detection of Relevant Communities in Large-Scale Networks , 2013, Comput. J..

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

[20]  Rolf T. Wigand,et al.  Community Detection in Complex Networks: Multi-objective Enhanced Firefly Algorithm , 2013, Knowl. Based Syst..