Column generation algorithms for exact modularity maximization in networks.

Finding modules, or clusters, in networks currently attracts much attention in several domains. The most studied criterion for doing so, due to Newman and Girvan [Phys. Rev. E 69, 026113 (2004)], is modularity maximization. Many heuristics have been proposed for maximizing modularity and yield rapidly near optimal solution or sometimes optimal ones but without a guarantee of optimality. There are few exact algorithms, prominent among which is a paper by Xu [Eur. Phys. J. B 60, 231 (2007)]. Modularity maximization can also be expressed as a clique partitioning problem and the row generation algorithm of Grötschel and Wakabayashi [Math. Program. 45, 59 (1989)] applied. We propose to extend both of these algorithms using the powerful column generation methods for linear and non linear integer programming. Performance of the four resulting algorithms is compared on problems from the literature. Instances with up to 512 entities are solved exactly. Moreover, the computing time of previously solved problems are reduced substantially.

[1]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

[2]  R. Fortet.  L’algebre de Boole et ses applications en recherche operationnelle , 1960 .

[3]  Jeanine Weekes Schroer,et al.  The Finite String Newsletter Abstracts of Current Literature Glisp User's Manual , 2022 .

[4]  Yoshiko Wakabayashi,et al.  A cutting plane algorithm for a clustering problem , 1989, Math. Program..

[5]  Martin Grötschel,et al.  Facets of the clique partitioning polytope , 1990, Math. Program..

[6]  Gary Klein,et al.  Optimal clustering: A model and method , 1991 .

[7]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

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

[9]  Pierre Hansen,et al.  Cluster analysis and mathematical programming , 1997, Math. Program..

[10]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[11]  Pierre Hansen,et al.  An Interior Point Algorithm for Minimum Sum-of-Squares Clustering , 1997, SIAM J. Sci. Comput..

[12]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[13]  B. Jaumard,et al.  A Simple Enumerative Algorithm for Unconstrained 0-1 Quadratic Programming , 2000 .

[14]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[15]  Frank Plastria,et al.  Formulating logical implications in combinatorial optimisation , 2002, Eur. J. Oper. Res..

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

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

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

[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]  Hanif D. Sherali,et al.  A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem , 2005, J. Glob. Optim..

[21]  Boris Mirkin,et al.  Clustering For Data Mining: A Data Recovery Approach (Chapman & Hall/Crc Computer Science) , 2005 .

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

[23]  Thorsten Koch,et al.  Branching rules revisited , 2005, Oper. Res. Lett..

[24]  J. Doye,et al.  Identifying communities within energy landscapes. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[26]  R. Guimerà,et al.  Functional cartography of complex metabolic networks , 2005, Nature.

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

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

[29]  Leon Danon,et al.  The effect of size heterogeneity on community identification in complex networks , 2006, physics/0601144.

[30]  Martin W. P. Savelsbergh,et al.  A generic view of Dantzig-Wolfe decomposition in mixed integer programming , 2006, Oper. Res. Lett..

[31]  Haluk Bingol,et al.  Community Detection in Complex Networks Using Genetic Algorithms , 2006, 0711.0491.

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

[33]  Jari Saramäki,et al.  Limited resolution and multiresolution methods in complex network community detection , 2007, SPIE International Symposium on Fluctuations and Noise.

[34]  Lazaros G. Papageorgiou,et al.  Finding community structures in complex networks using mixed integer optimisation , 2007 .

[35]  Ken Wakita,et al.  Finding community structure in mega-scale social networks: [extended abstract] , 2007, WWW '07.

[36]  Z. Di,et al.  Accuracy and precision of methods for community identification in weighted networks , 2006, physics/0607271.

[37]  Lars Kai Hansen,et al.  Deterministic modularity optimization , 2007 .

[38]  Alain Billionnet,et al.  Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem , 2007, Math. Program..

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

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

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

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

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

[44]  Weixiong Zhang,et al.  Identifying network communities with a high resolution. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[46]  Duanbing Chen,et al.  A fast and efficient heuristic algorithm for detecting community structures in complex networks , 2009 .

[47]  Xiang-Sun Zhang,et al.  A Constrained Optimization Method for Community Detection , 2009 .

[48]  Kevin E. Bassler,et al.  Improved community structure detection using a modified fine-tuning strategy , 2009, ArXiv.

[49]  Xiang-Sun Zhang,et al.  Modularity optimization in community detection of complex networks , 2009 .

[50]  C O Dorso,et al.  Alternative approach to community detection in networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[52]  P. Mucha,et al.  Spectral tripartitioning of networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[53]  Ying Xuan,et al.  Modularity-Maximizing Graph Communities via Mathematical Programming , 2009 .

[54]  Juan Mei,et al.  Revealing network communities through modularity maximization by a contraction–dilation method , 2009 .

[55]  Andreas Noack,et al.  Multi-level Algorithms for Modularity Clustering , 2008, SEA.

[56]  William J. Cook,et al.  Certification of an optimal TSP tour through 85, 900 cities , 2009, Oper. Res. Lett..

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

[58]  Pierre Hansen,et al.  Loops and multiple edges in modularity maximization of networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[59]  Pierre Hansen,et al.  An improved column generation algorithm for minimum sum-of-squares clustering , 2009, Math. Program..