Locally optimal heuristic for modularity maximization of networks

Abstract : Community detection in networks based on modularity maximization is currently done with hierarchical divisive or agglomerative as well as partitioning heuristics, hybrids, and, in a few papers, exact algorithms. We consider here the case of hierarchical networks in which communities should be detected and propose a divisive heuristic which is locally optimal in the sense that each of the successive bipartitions is done in a provably optimal way. This heuristic is compared with the spectral-based hierarchical divisive heuristic of Newman [Proc. Natl. Acad. Sci. USA 103, 8577 (2006).] and with the hierarchical agglomerative heuristic of Clauset, Newman, and Moore [Phys. Rev. E 70, 066111 (2004).]. Computational results are given for a series of problems of the literature with up to 4941 vertices and 6594 edges. They show that the proposed divisive heuristic gives better results than the divisive heuristic of Newman and than the agglomerative heuristic of Clauset et al.
Document type :
Journal articles
Complete list of metadatas

Cited literature [47 references]  Display  Hide  Download

https://hal-enac.archives-ouvertes.fr/hal-00934660
Contributor : Laurence Porte <>
Submitted on : Tuesday, April 8, 2014 - 4:25:26 PM
Last modification on : Tuesday, September 17, 2019 - 4:20:07 PM
Long-term archiving on: Tuesday, July 8, 2014 - 10:43:20 AM

File

579.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Sonia Cafieri, Pierre Hansen, Leo Liberti. Locally optimal heuristic for modularity maximization of networks. Physical Review E : Statistical, Nonlinear, and Soft Matter Physics, American Physical Society, 2011, 83 (5), pp 056105-1 - 056105-8. ⟨10.1103/PhysRevE.83.056105⟩. ⟨hal-00934660⟩

Share

Metrics

Record views

585

Files downloads

380