CLUBench: A Clustering Benchmark
Not on the map. Why?
Abstract (arXiv)
Clustering is a fundamental problem in data science with a long-standing research history, yielding numerous insightful algorithms. Despite this progress, a systematic and large-scale empirical evaluation that jointly considers conventional algorithms, deep learning-based methods, and recent foundation model-based clustering remains largely absent, leading to limited guidance on algorithm selection and deployment. To address this gap, we introduce CLUBench, a comprehensive clustering benchmark comprising 24 algorithms of diverse principles evaluated on 131 datasets across tabular, text, and image data, involving 178,815 experiments. Importantly, our analyses of (i) the impact of hyperparameter tuning,(ii) the impact of data types and characteristics,(iii) the impact of pretrained embeddings,(iv) large language model-based clustering,(v) the similarity of algorithms, and (vi) the low-rank structures of performance matrices, yield meaningful insights and promising pathways for clustering research. For instance, our study reveals that: 1) All evaluated deep clustering methods do not exhibit a significant advantage compared with the top-performing conventional clustering algorithms (e.g., KMeans, SpeClu) in terms of average performance; 2) For image and text clustering tasks, combining pretrained embeddings with conventional clustering algorithms (e.g., KMeans, SpeClu) offers effective and efficient clustering; 3) Clustering remains a challenging and nontrivial problem, even in the era of increasingly dominant foundation models. Moreover, we propose to use the low-rank structure in cross-model performance matrices to efficiently approximate the overall performance evaluation in practical applications. We further demonstrate the feasibility of model selection based on the performance matrices across all hyperparameter configurations.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 49 of its 110 references that are in the map. First posted on arXiv 28 May 2026.
Builds on
49 of 110 references.
References · 49
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,020
- 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
- 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 643
- 2019Self-labelling via simultaneous clustering and representation learningcited by 525
- 2020Contrastive Clusteringcited by 264
- 2018Meta-Learning: A Surveycited by 254
- 2019Learning to Discover Novel Visual Categories via Deep Transfer Clusteringcited by 223
- 2016Deep Unsupervised Clustering with Gaussian Mixture Variational Autoencoderscited by 219
37 more
- 2016Variational Deep Embedding: An Unsupervised and Generative Approach to Clusteringcited by 219
- 2016Joint Unsupervised Learning of Deep Representations and Image Clusterscited by 205
- 2021SPICE: Semantic Pseudo-labeling for Image Clusteringcited by 104
- 2017Deep Subspace Clustering Networkscited by 94
- 2019Deep Comprehensive Correlation Mining for Image Clusteringcited by 80
- 2022Deep Clustering: A Comprehensive Surveycited by 78
- 2022A Comprehensive Survey on Deep Clustering: Taxonomy, Challenges, and Future Directionscited by 73
- 2019Large-scale Multi-view Subspace Clustering in Linear Timecited by 66
- 2022Twin Contrastive Learning for Online Clusteringcited by 60
- 2022Simple Contrastive Graph Clusteringcited by 56
- 2018Clustering with Deep Learning: Taxonomy and New Methodscited by 45
- 2022HCSC: Hierarchical Contrastive Selective Codingcited by 43
- 2021You Never Cluster Alonecited by 38
- 2023Image Clustering with External Guidancecited by 36
- 2023Deep Multiview Clustering by Contrasting Cluster Assignmentscited by 33
- 2019Deep Discriminative Clustering Analysiscited by 28
- 2022A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resourcecited by 26
- 2020A Benchmark Study on Time Series Clusteringcited by 25
- 2023Stable Cluster Discrimination for Deep Clusteringcited by 24
- 2021Clustering by Maximizing Mutual Information Across Viewscited by 23
- 2020SimpleMKKM: Simple Multiple Kernel K-meanscited by 20
- 2013Semi-supervised clustering methodscited by 18
- 2023DivClust: Controlling Diversity in Deep Clusteringcited by 18
- 2020Stochastic Sparse Subspace Clusteringcited by 17
- 2019Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recoverycited by 15
- 2020Large-Scale Subspace Clustering via k-Factorizationcited by 14
- 2024German Text Embedding Clustering Benchmarkcited by 13
- 2024P2OT: Progressive Partial Optimal Transport for Deep Imbalanced Clusteringcited by 13
- 2021A Simple Approach to Automated Spectral Clusteringcited by 10
- 2024A Rapid Review of Clustering Algorithmscited by 9
- 2025On the Provable Importance of Gradients for Language-Assisted Image Clusteringcited by 8
- 2024Spectral Subspace Clustering for Attributed Graphscited by 6
- 2025Measuring the Validity of Clustering Validation Datasetscited by 6
- 2025Hierarchical Semantic Alignment for Image Clusteringcited by 5
- 2025scCluBench: Comprehensive Benchmarking of Clustering Algorithms for Single-Cell RNA Sequencingcited by 3
- 2021HAWKS: Evolving Challenging Benchmark Sets for Cluster Analysiscited by 2
- 2025You Can Trust Your Clustering Model: A Parameter-free Self-Boosting Plug-in for Deep Clusteringcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.