The Effect of Network Realism on Community Detection Algorithms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

The Effect of Network Realism on Community Detection Algorithms

Vincent Labatut

Résumé

Community detection consists in searching cohesive subgroups in complex networks. It has recently become one of the domain pivotal questions for scientists in many different fields where networks are used as modeling tools. Algorithms performing community detection are usually tested on real, but also on artificial networks, the former being costly and difficult to obtain. In this context, being able to generate networks with realistic properties is crucial for the reliability of the tests. Recently, Lancichinetti et al. [1] designed a method to produce realistic networks, with a community structure and power law distributed degrees and community sizes. However, other realistic properties such as degree correlation and transitivity are missing. In this work, we propose a modification of their approach, based on the preferential attachment model, in order to remedy this limitation. We analyze the properties of the generated networks and compare them to the original approach. We then apply different community detection algorithms and observe significant changes in their performances when compared to results on networks generated with the original approach.
Fichier principal
Vignette du fichier
orman2010a.pdf (353.35 Ko) Télécharger le fichier
presentation (1).pdf (515.41 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00633641 , version 1 (19-10-2011)

Identifiants

Citer

Günce Orman, Vincent Labatut. The Effect of Network Realism on Community Detection Algorithms. International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2010, Odense, Denmark. pp.301-305, ⟨10.1109/ASONAM.2010.70⟩. ⟨hal-00633641⟩
133 Consultations
235 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More