Expected Nodes: A Quality Function for the Detection of Link Communities - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Expected Nodes: A Quality Function for the Detection of Link Communities

(1) , (1) , (1) , (1)
1
Noé Gaumont
Connectez-vous pour contacter l'auteur
François Queyroi
Clémence Magnien
Matthieu Latapy

Abstract

Many studies use community detection algorithms in order to understand complex networks. Most papers study node communities, i.e. groups of nodes, which may or may not overlap. A widely used measure to evaluate the quality of a community structure is the modularity. However, sometimes it is also relevant to study link partitions rather than node partitions. In order to evaluate a link partition, we propose a new quality function: Expected Nodes. Our function is based on the same inspiration as the modularity and compares, for a given link group, the number of incident nodes to the expected one. In this short note, we discuss the advantages and drawbacks of our quality function compared to other ones on synthetics graphs. We show that Expected Nodes is able to pass some fundamental sanity criteria and is the one that best identifies the most relevant partition in a more realistic context.
Fichier principal
Vignette du fichier
Paper39.pdf (193.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01196796 , version 1 (10-09-2015)

Licence

Copyright

Identifiers

Cite

Noé Gaumont, François Queyroi, Clémence Magnien, Matthieu Latapy. Expected Nodes: A Quality Function for the Detection of Link Communities. 6th Workshop on Complex Networks CompleNet 2015, Mar 2015, New-York, United States. pp.57-64, ⟨10.1007/978-3-319-16112-9_6⟩. ⟨hal-01196796⟩
133 View
148 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More