mlsanityData to 7 Oct 2026

Deep Clustering Using the Soft Silhouette Score: Towards Compact and Well-Separated Clusters

arXiv 2402.00608 ↗First posted 1 Feb 2024cs.LG cs.CVcited by 6

Not on the map. Why?

Abstract (arXiv)

Unsupervised learning has gained prominence in the big data era, offering a means to extract valuable insights from unlabeled datasets. Deep clustering has emerged as an important unsupervised category, aiming to exploit the non-linear mapping capabilities of neural networks in order to enhance clustering performance. The majority of deep clustering literature focuses on minimizing the inner-cluster variability in some embedded space while keeping the learned representation consistent with the original high-dimensional dataset. In this work, we propose soft silhoutte, a probabilistic formulation of the silhouette coefficient. Soft silhouette rewards compact and distinctly separated clustering solutions like the conventional silhouette coefficient. When optimized within a deep clustering framework, soft silhouette guides the learned representations towards forming compact and well-separated clusters. In addition, we introduce an autoencoder-based deep learning architecture that is suitable for optimizing the soft silhouette objective function. The proposed deep clustering method has been tested and compared with several well-studied deep clustering methods on various benchmark datasets, yielding very satisfactory clustering results.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 25 of its 83 references that are in the map. First posted on arXiv 1 Feb 2024.

Builds on

25 of 83 references.

References · 25

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  3. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  4. 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,571
  5. 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
  6. 2018Deep Learning for Classical Japanese Literaturecited by 415
  7. 2016Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clusteringcited by 237
  8. 2016Variational Deep Embedding: An Unsupervised and Generative Approach to Clusteringcited by 219
  9. 2016Joint Unsupervised Learning of Deep Representations and Image Clusterscited by 205
  10. 2017Network Representation Learning: A Surveycited by 101
  11. 2022Deep Clustering: A Comprehensive Surveycited by 78
  12. 2018ClusterGAN : Latent Space Clustering in Generative Adversarial Networkscited by 75
13 more
  1. 2022A Comprehensive Survey on Deep Clustering: Taxonomy, Challenges, and Future Directionscited by 73
  2. 2018Clustering with Deep Learning: Taxonomy and New Methodscited by 45
  3. 2017Discriminatively Boosted Image Clustering with Fully Convolutional Auto-Encoderscited by 32
  4. 2018Deep Density-based Image Clusteringcited by 28
  5. 2022Strongly Augmented Contrastive Clusteringcited by 14
  6. 2020Minimum adjusted Rand index for two clusterings of a given sizecited by 13
  7. 2019Adversarial Deep Embedded Clustering: on a better trade-off between Feature Randomness and Feature Driftcited by 12
  8. 2021Deep Embedded K-Means Clusteringcited by 12
  9. 2019Spectral Clustering via Ensemble Deep Autoencoder Learning (SC-EDAE)cited by 10
  10. 2024Revisiting Silhouette Aggregationcited by 5
  11. 2022Global k-means++: an effective relaxation of the global k-means clustering algorithmcited by 4
  12. 2015Minimum Density Hyperplanescited by 3
  13. 2023UniForCE: The Unimodality Forest Method for Clustering and Estimation of the Number of Clusterscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 2; 2026: 2.

6 papers.