Uncovering Overlapping Community Structure

Wang Qinna 1, 2 Eric Fleury 1, 2
1 DNET - Dynamic Networks
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Overlapping community structure has attracted much interest in recent years since Palla et al. proposed the k-clique percolation algorithm for community detection and pointed out that the overlapping community structure is more reasonable to capture the topology of networks. Despite many efforts to detect overlapping communities, the overlapping community problem is still a great challenge in complex networks. Here we introduce an approach to identify overlapping community structure based on an efficient partition algorithm. In our method, communities are formed by merging peripheral clusters with cores. Therefore, communities are allowed to overlap. We show experimental studies on synthetic networks and real networks to demonstrate that our method has excellent performances in community detection.
Type de document :
Communication dans un congrès
Second International Workshop, CompleNet 2010, Oct 2010, Rio de Janeiro, Brazil. Springer, pp.176-186, 2010, Complex Networks. 〈http://link.springer.com/chapter/10.1007%2F978-3-642-25501-4_18?LI=true〉. 〈10.1007/978-3-642-25501-4_18〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00533314
Contributeur : Eric Fleury <>
Soumis le : vendredi 5 novembre 2010 - 16:32:36
Dernière modification le : vendredi 20 avril 2018 - 15:44:26

Identifiants

Citation

Wang Qinna, Eric Fleury. Uncovering Overlapping Community Structure. Second International Workshop, CompleNet 2010, Oct 2010, Rio de Janeiro, Brazil. Springer, pp.176-186, 2010, Complex Networks. 〈http://link.springer.com/chapter/10.1007%2F978-3-642-25501-4_18?LI=true〉. 〈10.1007/978-3-642-25501-4_18〉. 〈inria-00533314〉

Partager

Métriques

Consultations de la notice

227