Ascent–descent variable neighborhood decomposition search for community detection by modularity maximization

In this paper we propose a new variant of the Variable Neighborhood Decomposition Search (VNDS) heuristic for solving global optimization problems. We call it Ascent-Descent VNDS since it performs “boundary effect”, or local search step, even if the improvement in solving the subproblem has not been obtained. We apply it in detecting communities in large networks by modularity maximization, the criterion which is, despite of some recent criticism, most widely used. Computational analysis is performed on 22 instances from the 10th DIMACS Implementation Challenge. On 13 instances where optimal solutions were not known, we got the improved best known solutions on 9 instances and on 4 instances the solution was equal to the best known. Thus, the proposed new heuristic outperforms the current state-of-the-art algorithms from the literature.

[1]  Ulrik Brandes,et al.  On Modularity Clustering , 2008, IEEE Transactions on Knowledge and Data Engineering.

[2]  J. Reichardt,et al.  Statistical mechanics of community detection. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Yan Qing Niu,et al.  Detecting the community structure in complex networks based on quantum mechanics , 2008 .

[4]  M. Urbaniak,et al.  Thermal entanglement in a triple quantum dot system , 2013 .

[5]  Carlo Ratti,et al.  A General Optimization Technique for High Quality Community Detection in Complex Networks , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  M. Barber,et al.  Detecting network communities by propagating labels under constraints. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[8]  P. Hansen,et al.  Column generation algorithms for exact modularity maximization in networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[10]  Peng Wu,et al.  Multi-Objective Community Detection Based on Memetic Algorithm , 2015, PloS one.

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

[12]  V. Latora,et al.  Detecting complex network modularity by dynamical clustering. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[14]  Hristo Djidjev,et al.  A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection , 2007, WAW.

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

[16]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[18]  Athanasios Kehagias,et al.  Bad communities with high modularity , 2012, The European Physical Journal B.

[19]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[21]  A. Medus,et al.  Detection of community structures in networks via global optimization , 2005 .

[22]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[23]  My T. Thai,et al.  Towards Optimal Community Detection: From Trees to General Weighted Networks , 2012 .

[24]  A. M. Jayannavar,et al.  Exchange fluctuation theorems for a chain of interacting particles in presence of two heat baths , 2013, 1312.4677.

[25]  Leonidas S. Pitsoulis,et al.  Community detection by modularity maximization using GRASP with path relinking , 2013, Comput. Oper. Res..

[26]  Peng Gang Sun,et al.  Community detection by fuzzy clustering , 2015 .

[27]  Charles J. Alpert,et al.  Spectral Partitioning: The More Eigenvectors, The Better , 1995, 32nd Design Automation Conference.

[28]  Pierre Hansen,et al.  Variable Neighborhood Decomposition Search , 1998, J. Heuristics.

[29]  Dorit S. Hochbaum,et al.  Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[30]  Hao Lou,et al.  Detecting community structure using label propagation with weighted coherent neighborhood propinquity , 2013 .

[31]  Bin Zhou,et al.  Fuzzy community detection via modularity guided membership-degree propagation , 2016, Pattern Recognit. Lett..

[32]  T. Murata,et al.  Advanced modularity-specialized label propagation algorithm for detecting communities in networks , 2009, 0910.1154.

[33]  Timothy C. Havens,et al.  Fuzzy community detection in social networks using a genetic algortihm , 2014, 2014 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE).

[34]  Pierre Hansen,et al.  Variable neighborhood search: basics and variants , 2017, EURO J. Comput. Optim..

[35]  Andreas Geyer-Schulz,et al.  An ensemble learning strategy for graph clustering , 2012, Graph Partitioning and Graph Clustering.

[36]  N. Mladenović,et al.  Sum-of-squares clustering on networks , 2011 .

[37]  Noriyoshi Sukegawa,et al.  Redundant constraints in the standard formulation for the clique partitioning problem , 2015, Optim. Lett..

[38]  Nenad Mladenovic,et al.  Variable neighborhood search for minimum sum-of-squares clustering on networks , 2012, Eur. J. Oper. Res..

[39]  Pierre Hansen,et al.  A VNS heuristic for escaping local extrema entrapment in normalized cut clustering , 2012, Pattern Recognit..

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

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

[42]  Sonia Cafieri,et al.  Edge-ratio network clustering by Variable Neighborhood Search , 2013 .

[43]  Pierre Hansen,et al.  Edge ratio and community structure in networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[44]  Nenad Mladenović,et al.  New variable neighbourhood search based 0-1 MIP heuristics , 2014 .

[45]  Pierre Hansen,et al.  Reformulation of a model for hierarchical divisive graph modularity maximization , 2012, Annals of Operations Research.

[46]  Pierre Hansen,et al.  Modularity maximization in networks by variable neighborhood search , 2011, Graph Partitioning and Graph Clustering.