Deep Online Probability Aggregation Clustering
Not on the map. Why?
Abstract (arXiv)
Combining machine clustering with deep models has shown remarkable superiority in deep clustering. It modifies the data processing pipeline into two alternating phases: feature clustering and model training. However, such alternating schedule may lead to instability and computational burden issues. We propose a centerless clustering algorithm called Probability Aggregation Clustering (PAC) to proactively adapt deep learning technologies, enabling easy deployment in online deep clustering. PAC circumvents the cluster center and aligns the probability space and distribution space by formulating clustering as an optimization problem with a novel objective function. Based on the computation mechanism of the PAC, we propose a general online probability aggregation module to perform stable and flexible feature clustering over mini-batch data and further construct a deep visual clustering framework deep PAC (DPAC). Extensive experiments demonstrate that PAC has superior clustering robustness and performance and DPAC remarkably outperforms the state-of-the-art deep clustering methods.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 33 of its 61 references that are in the map. First posted on arXiv 7 Jul 2024.
Builds on
33 of 61 references.
References · 33
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
- 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,393
- 2020Big Self-Supervised Models are Strong Semi-Supervised Learnerscited by 1,375
- 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,020
- 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
- 2020Prototypical Contrastive Learning of Unsupervised Representationscited by 636
21 more
- 2019Self-labelling via simultaneous clustering and representation learningcited by 525
- 2020SCAN: Learning to Classify Images without Labelscited by 351
- 2020Contrastive Clusteringcited by 264
- 2016Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clusteringcited by 237
- 2021SPICE: Semantic Pseudo-labeling for Image Clusteringcited by 104
- 2020Online Deep Clustering for Unsupervised Representation Learningcited by 99
- 2019Efficient Parameter-free Clustering Using First Neighbor Relationscited by 96
- 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
- 2022DeepDPM: Deep Clustering With an Unknown Number of Clusterscited by 52
- 2021MiCE: Mixture of Contrastive Experts for Unsupervised Image Clusteringcited by 42
- 2021You Never Cluster Alonecited by 38
- 2023Exploring the Limits of Deep Image Clustering using Pretrained Modelscited by 33
- 2021Unsupervised Visual Representation Learning by Online Constrained K-Meanscited by 27
- 2023Stable Cluster Discrimination for Deep Clusteringcited by 24
- 2014Optimized Cartesian K-Meanscited by 14
- 2023ProtoCon: Pseudo-label Refinement via Online Clustering and Prototypical Consistency for Efficient Semi-supervised Learningcited by 13
- 2021Representation Learning for Clustering via Building Consensuscited by 7
- 2023Contrastive Hierarchical Clusteringcited by 3
Built on by
Citing papers per year: 2025: 2.
2 papers.