# Comparison and Benchmark of Graph Clustering Algorithms

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

## Key facts

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

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

- [A Survey on Echo Chambers on Social Media: Description, Detection and Mitigation](https://mlsanity.com/paper/2112.05084/) (2021)
- [The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering](https://mlsanity.com/paper/2411.10290/) (2024)

## Abstract (arXiv)

Graph clustering is widely used in analysis of biological networks, social networks and etc. For over a decade many graph clustering algorithms have been published, however a comprehensive and consistent performance comparison is not available. In this paper we benchmarked more than 70 graph clustering programs to evaluate their runtime and quality performance for both weighted and unweighted graphs. We also analyzed the characteristics of ground truth that affects the performance. Our work is capable to not only supply a start point for engineers to select clustering algorithms but also could provide a viewpoint for researchers to design new algorithms.