Journal articles
Improving heuristics for network modularity maximization using an exact algorithm
Abstract : Heuristics are widely applied to modularity maximization models for the identification of communities in complex networks. We present an approach to be applied as a post-processing to heuristic methods in order to improve their performances. Starting from a given partition, we test with an exact algorithm for bipartitioning if it is worthwhile to split some communities or to merge two of them. A combination of merge and split actions is also performed. Computational experiments show that the proposed approach is effective in improving heuristic results.
Cited literature [48 references]
https://hal-enac.archives-ouvertes.fr/hal-00935211
Contributor : Laurence Porte <>
Submitted on : Thursday, April 3, 2014 - 3:36:40 PM
Last modification on : Wednesday, May 6, 2020 - 5:44:10 PM
Document(s) archivé(s) le : Thursday, July 3, 2014 - 10:42:32 AM
Contributor : Laurence Porte <>
Submitted on : Thursday, April 3, 2014 - 3:36:40 PM
Last modification on : Wednesday, May 6, 2020 - 5:44:10 PM
Document(s) archivé(s) le : Thursday, July 3, 2014 - 10:42:32 AM
File
577.pdf
Files produced by the author(s)
