Reformulation of a locally optimal heuristic for modularity maximization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année :

Reformulation of a locally optimal heuristic for modularity maximization

(1) , (2) , (1, 3)
1
2
3

Résumé

A network, or graph, G = (V,E) consists of a set of vertices V = {1, . . . , n} and a set of edges E = {1, . . . ,m} connecting vertices. One of the most studied problems in the field of complex systems is to find communities, or clusters, in networks. A community consists of a subset S of the vertices of V where inner edges connecting pairs of vertices of S are more dense than cut edges connecting vertices of S to vertices of V \S. Many criteria have been proposed to evaluate partitions of V into communities.
Fichier principal
Vignette du fichier
341.pdf (79.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00934798 , version 1 (08-04-2014)

Identifiants

  • HAL Id : hal-00934798 , version 1

Citer

Alberto Costa, Sonia Cafieri, Pierre Hansen. Reformulation of a locally optimal heuristic for modularity maximization. ROADEF 2012, 13ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Apr 2012, Angers, France. ⟨hal-00934798⟩
171 Consultations
83 Téléchargements

Partager

Gmail Facebook Twitter LinkedIn More