# Minimum adjusted Rand index for two clusterings of a given size

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

## Key facts

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

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

- [Deep Clustering Using the Soft Silhouette Score: Towards Compact and Well-Separated Clusters](https://mlsanity.com/paper/2402.00608/) (2024)
- [Revisiting Silhouette Aggregation](https://mlsanity.com/paper/2401.05831/) (2024)
- [Normalised clustering accuracy: An asymmetric external cluster validity measure](https://mlsanity.com/paper/2209.02935/) (2022)
- [Integrating Audio, Visual, and Semantic Information for Enhanced Multimodal Speaker Diarization](https://mlsanity.com/paper/2408.12102/) (2024)
- [MNIST-Nd: a set of naturalistic datasets to benchmark clustering across dimensions](https://mlsanity.com/paper/2410.16124/) (2024)
- [Unsupervised Learning of Nanoindentation Data to Infer Microstructural Details of Complex Materials](https://mlsanity.com/paper/2309.06613/) (2023)
- [Circular Clustering with Polar Coordinate Reconstruction](https://mlsanity.com/paper/2309.08757/) (2023)
- [A Semidefinite Relaxation Approach for Fair Graph Clustering](https://mlsanity.com/paper/2410.15233/) (2024)
- [Spatio-temporal Multivariate Cluster Evolution Analysis for Detecting and Tracking Climate Impacts](https://mlsanity.com/paper/2410.16544/) (2024)
- [The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering](https://mlsanity.com/paper/2411.10290/) (2024)
- [Unraveling the cognitive patterns of Large Language Models through module communities](https://mlsanity.com/paper/2508.18192/) (2025)
- [ClustRecNet: A Novel End-to-End Deep Learning Framework for Clustering Algorithm Recommendation](https://mlsanity.com/paper/2509.25289/) (2025)
- [Learning inflection classes using Adaptive Resonance Theory](https://mlsanity.com/paper/2512.15551/) (2025)

## Abstract (arXiv)

The adjusted Rand index (ARI) is commonly used in cluster analysis to measure the degree of agreement between two data partitions. Since its introduction, exploring the situations of extreme agreement and disagreement under different circumstances has been a subject of interest, in order to achieve a better understanding of this index. Here, an explicit formula for the lowest possible value of the ARI for two clusterings of given sizes is shown, and moreover a specific pair of clusterings achieving such a bound is provided.