Evaluating Community Detection Algorithms: A multidimensional issue

HAL Id: hal-01796539

https://hal.archives-ouvertes.fr/hal-01796539

Submitted on 20 May 2018

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Evaluating Community Detection Algorithms: A multidimensional issue

Chantal Cherifi, Hocine Cherifi

To cite this version:

Chantal Cherifi, Hocine Cherifi. Evaluating Community Detection Algorithms: A multidimensional issue. International School and Conference on Network Science NETSCI 2018, Jun 2018, Paris, France.

2018. �hal-01796539�

Evaluating Community Detection Algorithms: A multidimensional issue

Chantal Cherifi Hocine Cherifi

University of Lyon 2 FRANCE

Problematic Classical approaches: Scalar

Drawback: Same values can represent very different situations

Multidimensional approach: Set of topological properties of the community structure

Mesoscopic Community size Node membership

Ranking the algorithms

General scheme Scalar

Hop-plot Average clustering as a function of node degree

Microscopic

Basic

Distribution

Results

I: Average Degree (AD), Internal Density (ID), IE: Average ODF (AO), Flake ODF (FO), Max ODF (MO), M: Overlapping Modularity (OM)

Number of nodes (V), Number of edges (E), Density (ρ), Diameter (d), Average shortest path (lG), Average node degree (deg), Max node degree (δ(G)), Assortativity (τ), Clustering (C)

Quality Desirable properties Clustering Ground-truth comparison

IT: Normalized Mutual Information (NMI), PC: Omega Index (OI), SC: F1-score

Compare the ground-truth community structure with the uncovered community structure

KS value degree distribution ground-truth: Power-Law (PL), Beta (BE), Cauchy (CA), Exponential

(E), Gamma (GM), Logistic (LO), Log-Normal (LN), Normal (N), Uniform (U), Weibull (WB) KS value degree distribution uncovered community structure Hypothesis: Power-law

Redundancy ?

Quality Clustering Community structure (Topo)

Low correlation

Each dimension shows a different view of the community structure

Topo, Quality or Clustering ? Topo is more flexible

The winner ?

University of Burgundy FRANCE

For more information: https://doi.org/10.1016/j.physa.2017.10.018

A1 A2 A3

A4 A5 An

Ranking the algorithms

Hypotheses:

Ground-truth community structure available Overlapping community detection algorithms

Open questions

1. What is the space size?

2. Ground-truth unavailable?

3. Non-overlapping communities?

2018

Overlap size

Degree distribution