Reformulation of a model for hierarchical divisive graph modularity maximization
- 367 Downloads
Finding clusters, or communities, in a graph, or network is a very important problem which arises in many domains. Several models were proposed for its solution. One of the most studied and exploited is the maximization of the so called modularity, which represents the sum over all communities of the fraction of edges within these communities minus the expected fraction of such edges in a random graph with the same distribution of degrees. As this problem is NP-hard, a few non-polynomial algorithms and a large number of heuristics were proposed in order to find respectively optimal or high modularity partitions for a given graph. We focus on one of these heuristics, namely a divisive hierarchical method, which works by recursively splitting a cluster into two new clusters in an optimal way. This splitting step is performed by solving a convex quadratic program. We propose a compact reformulation of such model, using change of variables, expansion of integers in powers of two and symmetry breaking constraints. The resolution time is reduced by a factor up to 10 with respect to the one obtained with the original formulation.
KeywordsClustering Compact reformulation Divisive hierarchical heuristic Modularity maximization
The authors would like to thank the anonymous referees for their precious comments and suggestions. Financial support by Grants Digiteo 2009-14D “RMNCCO” and Digiteo 2009-55D “ARM” is gratefully acknowledged. P.H. was partially supported by fqrnt (Fonds de recherche du Québec—Nature et technologies) team grant PR-131365.
- Batagelj, V., & Mrvar, A. (2006). Pajek datasets. http://vlado.fmf.uni-lj.si/pub/networks/data/.
- Fortet, R. (1960). Applications de l’algèbre de Boole en recherche opérationelle. Revue Française de Recherche Opérationelle, 4, 17–26. Google Scholar
- Hugo, V. (1951). Bibliothèque de la Pleiade. Les Misérables. Paris: Gallimard. Google Scholar
- IBM (2010). ILOG CPLEX 12.2 user’s manual. IBM. Google Scholar
- Knuth, D. E. (1993). The Stanford GraphBase: a platform for combinatorial computing. Reading: Addison-Wesley. Google Scholar
- Krebs, V. (2008). http://www.orgnet.com/.
- Zachary, W. W. (1977). An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33(4), 452–473. Google Scholar