A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
- 252 Downloads
Given a set of entities, cluster analysis aims at finding subsets, also called clusters or communities or modules, entities of which are homogeneous and well separated. In the last ten years clustering on networks, or graphs, has been a subject of intense study. Edges between pairs of vertices within the same cluster should be relatively dense, while edges between pairs of vertices in different clusters should be relatively sparse. This led Newman to define the modularity of a cluster as the difference between the number of internal edges and the expected number of such edges in a random graph with the same degree distribution. The modularity of a partition of the vertices is the sum of the modularities of its clusters. Modularity has been extended recently to the case of bipartite graphs. In this paper we propose a hierarchical divisive heuristic for approximate modularity maximization in bipartite graphs. The subproblem of bipartitioning a cluster is solved exactly; hence the heuristic is locally optimal. Several formulations of this subproblem are presented and compared. Some are much better than others, and this illustrates the importance of reformulations. Computational experiences on a series of ten test problems from the literature are reported.
KeywordsBipartite graphs Clustering Modularity maximization
The authors would like to thank Sonia Cafieri and Leo Liberti for the precious suggestions and comments. Financial support by grants: Digiteo 2009-14D “RMNCCO”, Digiteo 2009-55D “ARM” is gratefully acknowledged.
- 5.Batagelj, V., Mrvar, A.: Pajek datasets. http://vlado.fmf.uni-lj.si/pub/networks/data (2006)
- 9.Cafieri, S., Costa, A., Hansen P.: Reformulation of a model for hierarchical divisive graph modularity maximization. Ann. Operat. Res. (accepted)Google Scholar
- 13.Costa A.: Applications of reformulation in mathematical programming. PhD thesis, École Polytechnique (2012)Google Scholar
- 16.Fortet, R.: Applications de l’algèbre de Boole en recherche opérationelle. Revue Française de Recherche Opérationelle 4(14), 17–26 (1960)Google Scholar
- 20.Good, B.H., de Montjoye, Y.-A., Clauset, A.: Performance of modularity maximization in practical contexts. Phys. Rev. E 81(4), 046106 (2010)Google Scholar
- 21.IBM. ILOG CPLEX 12.2 User’s Manual. IBM (2010)Google Scholar
- 24.Liu, X., Murata, T.: Community detection in large-scale bipartite networks. In: IEEE/WIC/ACM international conference on web intelligence and Intelligent Agent Technologies, pp. 50–57 (2009)Google Scholar
- 25.Liu, X., Murata, T.: An efficient algorithm for optimizing bipartite modularity in bipartite networks. J. Adv. Comput. Intell. Intell. Inform. 14(4), 408–415 (2010)Google Scholar
- 30.Sales-Pardo, M., Guimerà, R., Moreira, A.A., Amaral, L.A.N.: Extracting the hierarchical organization of complex systems. Proc. Nat. Acad. Sci. USA 104(39), 15224–15229 (2007)Google Scholar