You Can Trust Your Clustering Model: A Parameter-free Self-Boosting Plug-in for Deep Clustering
Not on the map. Why?
Abstract (arXiv)
Recent deep clustering models have produced impressive clustering performance. However, a common issue with existing methods is the disparity between global and local feature structures. While local structures typically show strong consistency and compactness within class samples, global features often present intertwined boundaries and poorly separated clusters. Motivated by this observation, we propose DCBoost, a parameter-free plug-in designed to enhance the global feature structures of current deep clustering models. By harnessing reliable local structural cues, our method aims to elevate clustering performance effectively. Specifically, we first identify high-confidence samples through adaptive k-nearest neighbors-based consistency filtering, aiming to select a sufficient number of samples with high label reliability to serve as trustworthy anchors for self-supervision. Subsequently, these samples are utilized to compute a discriminative loss, which promotes both intra-class compactness and inter-class separability, to guide network optimization. Extensive experiments across various benchmark datasets showcase that our DCBoost significantly improves the clustering performance of diverse existing deep clustering models. Notably, our method improves the performance of current state-of-the-art baselines (e.g., ProPos) by more than 3% and amplifies the silhouette coefficient by over 7×. Code is available at <https://github.com/l-h-y168/DCBoost>.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 26 of its 42 references that are in the map. First posted on arXiv 26 Nov 2025.
Builds on
26 of 42 references.
References · 26
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
- 2020Exploring Simple Siamese Representation Learningcited by 2,866
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,857
- 2015Unsupervised Deep Embedding for Clustering Analysiscited by 767
- 2020Prototypical Contrastive Learning of Unsupervised Representationscited by 640
- 2020SCAN: Learning to Classify Images without Labelscited by 352
- 2020Contrastive Clusteringcited by 265
- 2021SPICE: Semantic Pseudo-labeling for Image Clusteringcited by 104
- 2020Multi-Objective Interpolation Training for Robustness to Label Noisecited by 86
14 more
- 2021Clustering-friendly Representation Learning via Instance Discrimination and Feature Decorrelationcited by 65
- 2021Graph Contrastive Clusteringcited by 61
- 2022Twin Contrastive Learning for Online Clusteringcited by 60
- 2021Learning Representation for Clustering via Prototype Scattering and Positive Samplingcited by 58
- 2021MiCE: Mixture of Contrastive Experts for Unsupervised Image Clusteringcited by 42
- 2021Attention-driven Graph Clustering Networkcited by 40
- 2021You Never Cluster Alonecited by 38
- 2023Image Clustering with External Guidancecited by 36
- 2022Semantic-Enhanced Image Clusteringcited by 25
- 2023Stable Cluster Discrimination for Deep Clusteringcited by 24
- 2021Deep Attention-guided Graph Clustering with Dual Self-supervisioncited by 10
- 2023Contextually Affinitive Neighborhood Refinery for Deep Clusteringcited by 10
- 2024Towards Calibrated Deep Clustering Networkcited by 4
- 2024Deep Online Probability Aggregation Clusteringcited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.