The Area Under the ROC Curve as a Measure of Clustering Quality
Not on the map. Why?
Abstract (arXiv)
The Area Under the the Receiver Operating Characteristics (ROC) Curve, referred to as AUC, is a well-known performance measure in the supervised learning domain. Due to its compelling features, it has been employed in a number of studies to evaluate and compare the performance of different classifiers. In this work, we explore AUC as a performance measure in the unsupervised learning domain, more specifically, in the context of cluster analysis. In particular, we elaborate on the use of AUC as an internal/relative measure of clustering quality, which we refer to as Area Under the Curve for Clustering (AUCC). We show that the AUCC of a given candidate clustering solution has an expected value under a null model of random clustering solutions, regardless of the size of the dataset and, more importantly, regardless of the number or the (im)balance of clusters under evaluation. In addition, we elaborate on the fact that, in the context of internal/relative clustering validation as we consider, AUCC is actually a linear transformation of the Gamma criterion from Baker and Hubert (1975), for which we also formally derive a theoretical expected value for chance clusterings. We also discuss the computational complexity of these criteria and show that, while an ordinary implementation of Gamma can be computationally prohibitive and impractical for most real applications of cluster analysis, its equivalence with AUCC actually unveils a much more efficient algorithmic procedure. Our theoretical findings are supported by experimental results. These results show that, in addition to an effective and robust quantitative evaluation provided by AUCC, visual inspection of the ROC curves themselves can be useful to further assess a candidate clustering solution from a broader, qualitative perspective as well.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 4; 2026: 1.
8 papers.
- 2023Clustering with minimum spanning trees: How good can it be?cited by 4
- 2024On the Use of Relative Validity Indices for Comparing Clustering Approachescited by 2
- 2025A Model-Mediated Stacked Ensemble Approach for Depression Prediction Among Professionalscited by 1
- 2025Decomposing Global AUC into Cluster-Level Contributions for Localized Model Diagnosticscited by 1
- 2025Benchmarking of Clustering Validity Measures Revisitedcited by 1
- 2023Clustering Validation with The Area Under Precision-Recall Curvescited by 0
- 2025FACROC: a fairness measure for FAir Clustering through ROC curvescited by 0
- 2026AlertBERT: A noise-robust alert grouping framework for simultaneous cyber attackscited by 0
- 2026AlertBERT: A noise-robust alert grouping framework for simultaneous cyber attacks6 Feb 2026
- 2025Benchmarking of Clustering Validity Measures Revisited8 Nov 2025
- 2025Decomposing Global AUC into Cluster-Level Contributions for Localized Model Diagnostics10 Aug 2025
- 2025A Model-Mediated Stacked Ensemble Approach for Depression Prediction Among Professionals17 Jun 2025
- 2025FACROC: a fairness measure for FAir Clustering through ROC curves2 Mar 2025
- 2024On the Use of Relative Validity Indices for Comparing Clustering Approaches16 Apr 2024
- 2023Clustering Validation with The Area Under Precision-Recall Curves4 Apr 2023
- 2023Clustering with minimum spanning trees: How good can it be?10 Mar 2023