Optimizing a hierarchical community structure of a complex network - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Advances in Knowledge Discovery and Management Année : 2014

Optimizing a hierarchical community structure of a complex network

Résumé

Many graph clustering algorithms perform successive divisions or aggregations of subgraphs leading to a hierarchical decomposition of the network. An important question in this domain is to know if this hierarchy reflects the structure of the network or if it is only an artifice due to the conduct of the procedure. We propose a method to validate and, if necessary, to optimize the multi-scale decomposition produced by such methods. We apply our procedure to the algorithm proposed by Blondel et al. (2008) based on modularity maximization. In this context, a generalization of this quality measure in the multi-level case is introduced. We test our method on random graphs and real world examples.
Fichier principal
Vignette du fichier
queyroi_akdm.pdf (539.82 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01018834 , version 1 (05-07-2014)

Identifiants

Citer

François Queyroi. Optimizing a hierarchical community structure of a complex network. Advances in Knowledge Discovery and Management, 2014, 4, pp.3-14. ⟨10.1007/978-3-319-02999-3_1⟩. ⟨hal-01018834⟩

Collections

CNRS TDS-MACS
133 Consultations
157 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More