A Modular Overlapping Community Detection Algorithm: Investigating the ``From Local to Global'' Approach - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

A Modular Overlapping Community Detection Algorithm: Investigating the ``From Local to Global'' Approach

Maximilien Danisch
  • Fonction : Auteur
  • PersonId : 940804
  • IdRef : 188447407
Noe Gaumont

Résumé

We propose an overlapping community detection algorithm following a “from local to global approach”: our algorithm finds local communities one by one by repetitively optimizing a quality function that measures the quality of a community. Then, as some extracted local communities can be very similar to each-other, a cleaning procedure is applied to obtain the global overlapping community structure. Our algorithm depends on three modules: (i) a quality function, (ii) an optimization heuristic and (iii) a cleaning procedure. Various such modules can be independently plugged in. We show that, using default modules, our algorithm improves over a state-of-the-art method on some real-world graphs with ground truth communities. In the future we would like to study which combination of modules performs best in practice and make our code parallel.
Fichier non déposé

Dates et versions

hal-02364496 , version 1 (15-11-2019)

Identifiants

  • HAL Id : hal-02364496 , version 1

Citer

Maximilien Danisch, Noe Gaumont, Jean-Loup Guillaume. A Modular Overlapping Community Detection Algorithm: Investigating the ``From Local to Global'' Approach. 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Jun 2018, Paris, France. pp.167-170. ⟨hal-02364496⟩
59 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More