An upper bound on the silhouette evaluation metric for clustering
Not on the map. Why?
Abstract (arXiv)
The silhouette coefficient quantifies, for each observation, the balance between within-cluster cohesion and between-cluster separation, taking values in the range [-1,1]. The average silhouette width (ASW) is a widely used internal measure of clustering quality, with higher values indicating more cohesive and well-separated clusters. However, the dataset-specific maximum of ASW is typically unknown, and the standard upper limit of 1 is rarely attainable. In this work, we derive for each data point a sharp upper bound on its silhouette width and aggregate these to obtain a canonical upper bound for the ASW. This bound-often substantially below 1-enhances the interpretability of empirical ASW values by providing guidance on how close a given clustering result is to the best possible outcome for that dataset. We evaluate the usefulness of the upper bound on a variety of datasets and conclude that it can meaningfully enrich cluster quality evaluation; however, its practical relevance depends on the specific dataset. Finally, we extend the framework to establish an upper bound for the macro-averaged silhouette.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 111 references that are in the map. First posted on arXiv 10 Sep 2025.
Builds on
11 of 111 references.
References · 11
- 2018Faster k-Medoids Clustering: Improving the PAM, CLARA, and CLARANS Algorithmscited by 44
- 2022Are Cluster Validity Measures (In)valid?cited by 16
- 2021Clustering performance analysis using a new correlation-based cluster validity indexcited by 9
- 2025Estimating the Optimal Number of Clusters in Categorical Data Clustering by Silhouette Coefficientcited by 6
- 2023A Self-Supervised Learning-based Approach to Clustering Multivariate Time-Series Data with Missing Values (SLAC-Time): An Application to TBI Phenotypingcited by 5
- 2023Medoid Silhouette clustering with automatic cluster number selectioncited by 5
- 2024Revisiting Silhouette Aggregationcited by 5
- 2022Clustering by Direct Optimization of the Medoid Silhouettecited by 4
- 2025Improving clustering quality evaluation in noisy Gaussian mixturescited by 3
- 2024Data clustering: a fundamental method in data science and managementcited by 2
- 2024On estimation and order selection for multivariate extremes via clusteringcited by 1
Built on by
Not cited yet.