# Analysis of Network Clustering Algorithms and Cluster Quality Metrics at Scale

arXiv: https://arxiv.org/abs/1605.05797 · HTML: https://mlsanity.com/paper/1605.05797/

## Key facts

- Cited by 10 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 19 May 2016.

## Built on by (most cited first, 10 of 10)

- [A Deep Variational Approach to Clustering Survival Data](https://mlsanity.com/paper/2106.05763/) (2021)
- [A Self-Supervised Learning-based Approach to Clustering Multivariate Time-Series Data with Missing Values (SLAC-Time): An Application to TBI Phenotyping](https://mlsanity.com/paper/2302.13457/) (2023)
- [Concept Drift Adaptation in Text Stream Mining Settings: A Systematic Review](https://mlsanity.com/paper/2312.02901/) (2023)
- [Co-clustering Vertices and Hyperedges via Spectral Hypergraph Partitioning](https://mlsanity.com/paper/2102.10169/) (2021)
- [Free Energy Node Embedding via Generalized Skip-gram with Negative Sampling](https://mlsanity.com/paper/2105.09182/) (2021)
- [Cold Start Active Learning Strategies in the Context of Imbalanced Classification](https://mlsanity.com/paper/2201.10227/) (2022)
- [Mixed Data Clustering Survey and Challenges](https://mlsanity.com/paper/2512.03070/) (2025)
- [Identifying bias in cluster quality metrics](https://mlsanity.com/paper/2112.06287/) (2021)
- [Hyperspectral image segmentation with a machine learning model trained using quantum annealer](https://mlsanity.com/paper/2503.01400/) (2025)
- [Analysis and Resilience of the U.S. Flight Network](https://mlsanity.com/paper/2505.11559/) (2025)

## Abstract (arXiv)

Notions of community quality underlie network clustering. While studies surrounding network clustering are increasingly common, a precise understanding of the realtionship between different cluster quality metrics is unknown. In this paper, we examine the relationship between stand-alone cluster quality metrics and information recovery metrics through a rigorous analysis of four widely-used network clustering algorithms -- Louvain, Infomap, label propagation, and smart local moving. We consider the stand-alone quality metrics of modularity, conductance, and coverage, and we consider the information recovery metrics of adjusted Rand score, normalized mutual information, and a variant of normalized mutual information used in previous work. Our study includes both synthetic graphs and empirical data sets of sizes varying from 1,000 to 1,000,000 nodes. We find significant differences among the results of the different cluster quality metrics. For example, clustering algorithms can return a value of 0.4 out of 1 on modularity but score 0 out of 1 on information recovery. We find conductance, though imperfect, to be the stand-alone quality metric that best indicates performance on information recovery metrics. Our study shows that the variant of normalized mutual information used in previous work cannot be assumed to differ only slightly from traditional normalized mutual information. Smart local moving is the best performing algorithm in our study, but discrepancies between cluster evaluation metrics prevent us from declaring it absolutely superior. Louvain performed better than Infomap in nearly all the tests in our study, contradicting the results of previous work in which Infomap was superior to Louvain. We find that although label propagation performs poorly when clusters are less clearly defined, it scales efficiently and accurately to large graphs with well-defined clusters.