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.
https://hal-enac.archives-ouvertes.fr/hal-00935211 Contributeur : Laurence PorteConnectez-vous pour contacter le contributeur Soumis le : jeudi 3 avril 2014 - 15:36:40 Dernière modification le : mardi 19 octobre 2021 - 11:02:48 Archivage à long terme le : : jeudi 3 juillet 2014 - 10:42:32