Improving heuristics for network modularity maximization using an exact algorithm - ENAC - École nationale de l'aviation civile Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2014

Improving heuristics for network modularity maximization using an exact algorithm

Résumé

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.
Fichier principal
Vignette du fichier
577.pdf (175.24 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00935211 , version 1 (03-04-2014)

Identifiants

Citer

Sonia Cafieri, Pierre Hansen, Leo Liberti. Improving heuristics for network modularity maximization using an exact algorithm. Discrete Applied Mathematics, 2014, 163 (1), pp 65-72. ⟨10.1016/j.dam.2012.03.030⟩. ⟨hal-00935211⟩
289 Consultations
323 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More