On the Use of Relative Validity Indices for Comparing Clustering Approaches
Not on the map. Why?
Abstract (arXiv)
Relative Validity Indices (RVIs) such as the Silhouette Width Criterion and Davies Bouldin indices are the most widely used tools for evaluating and optimising clustering outcomes. Traditionally, their ability to rank collections of candidate dataset partitions has been used to guide the selection of the number of clusters, and to compare partitions from different clustering algorithms. However, there is a growing trend in the literature to use RVIs when selecting a Similarity Paradigm (SP) for clustering - the combination of normalisation procedure, representation method, and distance measure which affects the computation of object dissimilarities used in clustering. Despite the growing prevalence of this practice, there has been no empirical or theoretical investigation into the suitability of RVIs for this purpose. Moreover, since RVIs are computed using object dissimilarities, it remains unclear how they would need to be implemented for fair comparisons of different SPs. This study presents the first comprehensive investigation into the reliability of RVIs for SP selection. We conducted extensive experiments with seven popular RVIs on over 2.7 million clustering partitions of synthetic and real-world datasets, encompassing feature-vector and time-series data. We identified fundamental conceptual limitations undermining the use of RVIs for SP selection, and our empirical findings confirmed this predicted unsuitability. Among our recommendations, we suggest instead that practitioners select SPs by using external validation on high quality labelled datasets or carefully designed outcome-oriented objective criteria, both of which should be informed by careful consideration of dataset characteristics, and domain requirements. Our findings have important implications for clustering methodology and evaluation, suggesting the need for more rigorous approaches to SP selection.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 20 of its 203 references that are in the map. First posted on arXiv 16 Apr 2024.
Builds on
20 of 203 references.
References · 20
- 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 385
- 2019Deep Spectral Clustering using Dual Autoencoder Networkcited by 71
- 2020Conditional GAN for timeseries generationcited by 37
- 2016Clustering Algorithms: A Comparative Approachcited by 28
- 2020A Benchmark Study on Time Series Clusteringcited by 25
- 2022Are Cluster Validity Measures (In)valid?cited by 16
- 2022A framework for benchmarking clustering algorithmscited by 15
- 2014Influential Feature PCA for high dimensional clusteringcited by 14
- 2018A survey on trajectory clustering analysiscited by 12
- 2022Genie: A new, fast, and outlier-resistant hierarchical clustering algorithmcited by 10
- 2021Clustering performance analysis using a new correlation-based cluster validity indexcited by 9
- 2020The Area Under the ROC Curve as a Measure of Clustering Qualitycited by 8
8 more
- 2017Shape-Based Approach to Household Load Curve Clustering and Predictioncited by 7
- 2021Characterizing and comparing external measures for the assessment of cluster analysis and community detectioncited by 6
- 2022A new measure for assessment of clustering based on kernel density estimationcited by 6
- 2022Benchmarking distance-based partitioning methods for mixed-type datacited by 6
- 2022Review of Clustering Methods for Functional Datacited by 6
- 2015Clustering strategy and method selectioncited by 5
- 2017Cluster validation by measurement of clustering characteristics relevant to the usercited by 3
- 2021Synthetic Time-Series Load Data via Conditional Generative Adversarial Networkscited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.