mlsanityData to 7 Oct 2026

Adaptive Self-supervised Robust Clustering for Unstructured Data with Unknown Cluster Number

arXiv 2407.20119 ↗First posted 29 Jul 2024cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

We introduce a novel self-supervised deep clustering approach tailored for unstructured data without requiring prior knowledge of the number of clusters, termed Adaptive Self-supervised Robust Clustering (ASRC). In particular, ASRC adaptively learns the graph structure and edge weights to capture both local and global structural information. The obtained graph enables us to learn clustering-friendly feature representations by an enhanced graph auto-encoder with contrastive learning technique. It further leverages the clustering results adaptively obtained by robust continuous clustering (RCC) to generate prototypes for negative sampling, which can further contribute to promoting consistency among positive pairs and enlarging the gap between positive and negative samples. ASRC obtains the final clustering results by applying RCC to the learned feature representations with their consistent graph structure and edge weights. Extensive experiments conducted on seven benchmark datasets demonstrate the efficacy of ASRC, demonstrating its superior performance over other popular clustering models. Notably, ASRC even outperforms methods that rely on prior knowledge of the number of clusters, highlighting its effectiveness in addressing the challenges of clustering unstructured data.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 58 references that are in the map. First posted on arXiv 29 Jul 2024.

Builds on

22 of 58 references.

References · 22

  1. 2016Variational Graph Auto-Encoderscited by 1,373
  2. 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
  3. 2020Self-supervised Graph Learning for Recommendationcited by 305
  4. 2016Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clusteringcited by 237
  5. 2020Structural Deep Clustering Networkcited by 145
  6. 2013Consistency of spectral clustering in stochastic block modelscited by 128
  7. 2018SpectralNet: Spectral Clustering using Deep Neural Networkscited by 94
  8. 2022Hard Sample Aware Network for Contrastive Deep Graph Clusteringcited by 61
  9. 2023Cluster-guided Contrastive Graph Clustering Networkcited by 60
  10. 2022Simple Contrastive Graph Clusteringcited by 56
  11. 2013Splitting Methods for Convex Clusteringcited by 28
  12. 2018Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithmcited by 26
10 more
  1. 2020Adaptive Graph Auto-Encoder for General Data Clusteringcited by 22
  2. 2015Statistical Properties of Convex Clusteringcited by 19
  3. 2023Reinforcement Graph Clustering with Unknown Cluster Numbercited by 16
  4. 2019Recovery of a mixture of Gaussians by sum-of-norms clusteringcited by 7
  5. 2014Convex clustering via ℓ1 fusion penalizationcited by 6
  6. 2018An Efficient Semismooth Newton Based Algorithm for Convex Clusteringcited by 5
  7. 2021Local versions of sum-of-norms clusteringcited by 4
  8. 2021On Convex Clustering Solutionscited by 3
  9. 2021A Dimension Reduction Technique for Large-scale Structured Sparse Optimization Problems with Application to Convex Clusteringcited by 3
  10. 2023Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guaranteescited by 1

Built on by

Not cited yet.