Unsupervised Deep Clustering of MNIST with Triplet-Enhanced Convolutional Autoencoders

• URL: http://arxiv.org/abs/2506.10094v1
• Date: Wed, 11 Jun 2025 18:26:13 GMT
• Title: Unsupervised Deep Clustering of MNIST with Triplet-Enhanced Convolutional Autoencoders
• Authors: Md. Faizul Islam Ansari,
• Abstract summary: This research implements an advanced unsupervised clustering system for MNIST handwritten digits.<n>A deep neural autoencoder requires a training process during phase one to develop minimal yet interpretive representations of images.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This research implements an advanced unsupervised clustering system for MNIST handwritten digits through two-phase deep autoencoder architecture. A deep neural autoencoder requires a training process during phase one to develop minimal yet interpretive representations of images by minimizing reconstruction errors. During the second phase we unify the reconstruction error with a KMeans clustering loss for learned latent embeddings through a joint distance-based objective. Our model contains three elements which include batch normalization combined with dropout and weight decay for achieving generalized and stable results. The framework achieves superior clustering performance during extensive tests which used intrinsic measurements including Silhouette Score and Davies-Bouldin Index coupled with extrinsic metrics NMI and ARI when processing image features. The research uses t-SNE visualization to present learned embeddings that show distinct clusters for digits. Our approach reaches an optimal combination between data reconstruction accuracy and cluster separation purity when adding the benefit of understandable results and scalable implementations. The approach creates a dependable base that helps deploy unsupervised representation learning in different large-scale image clustering applications.

Related papers

• Towards Learnable Anchor for Deep Multi-View Clustering [49.767879678193005]
  In this paper, we propose the Deep Multi-view Anchor Clustering (DMAC) model that performs clustering in linear time.<n>With the optimal anchors, the full sample graph is calculated to derive a discriminative embedding for clustering.<n>Experiments on several datasets demonstrate superior performance and efficiency of DMAC compared to state-of-the-art competitors.
  arXiv  Detail & Related papers  (2025-03-16T09:38:11Z)
• Autoencoded UMAP-Enhanced Clustering for Unsupervised Learning [49.1574468325115]
  We propose a novel approach to unsupervised learning by constructing a non-linear embedding of the data into a low-dimensional space followed by any conventional clustering algorithm.<n>The embedding promotes clusterability of the data and is comprised of two mappings: the encoder of an autoencoder neural network and the output of UMAP algorithm.<n>When applied to MNIST data, AUEC significantly outperforms the state-of-the-art techniques in terms of clustering accuracy.
  arXiv  Detail & Related papers  (2025-01-13T22:30:38Z)
• Class Anchor Margin Loss for Content-Based Image Retrieval [97.81742911657497]
  We propose a novel repeller-attractor loss that falls in the metric learning paradigm, yet directly optimize for the L2 metric without the need of generating pairs. We evaluate the proposed objective in the context of few-shot and full-set training on the CBIR task, by using both convolutional and transformer architectures.
  arXiv  Detail & Related papers  (2023-06-01T12:53:10Z)
• Deep Temporal Contrastive Clustering [21.660509622172274]
  This paper presents a deep temporal contrastive clustering approach. It incorporates the contrastive learning paradigm into the deep time series clustering research. Experiments on a variety of time series datasets demonstrate the superiority of our approach over the state-of-the-art.
  arXiv  Detail & Related papers  (2022-12-29T16:43:34Z)
• Deep Image Clustering with Contrastive Learning and Multi-scale Graph Convolutional Networks [58.868899595936476]
  This paper presents a new deep clustering approach termed image clustering with contrastive learning and multi-scale graph convolutional networks (IcicleGCN) Experiments on multiple image datasets demonstrate the superior clustering performance of IcicleGCN over the state-of-the-art.
  arXiv  Detail & Related papers  (2022-07-14T19:16:56Z)
• Self-Supervised Deep Subspace Clustering with Entropy-norm [0.0]
  Self-Supervised deep Subspace Clustering with Entropy-norm (S$3$CE) S$3$CE exploits a self-supervised contrastive network to gain a more effetive feature vector. New module with data enhancement is designed to help S$3$CE focus on the key information of data.
  arXiv  Detail & Related papers  (2022-06-10T09:15:33Z)
• Large-Scale Hyperspectral Image Clustering Using Contrastive Learning [18.473767002905433]
  We present a scalable deep online clustering model, named Spectral-Spatial Contrastive Clustering (SSCC) We exploit a symmetric twin neural network comprised of a projection head with a dimensionality of the cluster number to conduct dual contrastive learning from a spectral-spatial augmentation pool. The resulting approach is trained in an end-to-end fashion by batch-wise optimization, making it robust in large-scale data and resulting in good generalization ability for unseen data.
  arXiv  Detail & Related papers  (2021-11-15T17:50:06Z)
• Deep Attention-guided Graph Clustering with Dual Self-supervision [49.040136530379094]
  We propose a novel method, namely deep attention-guided graph clustering with dual self-supervision (DAGC) We develop a dual self-supervision solution consisting of a soft self-supervision strategy with a triplet Kullback-Leibler divergence loss and a hard self-supervision strategy with a pseudo supervision loss. Our method consistently outperforms state-of-the-art methods on six benchmark datasets.
  arXiv  Detail & Related papers  (2021-11-10T06:53:03Z)
• Cluster Analysis with Deep Embeddings and Contrastive Learning [0.0]
  This work proposes a novel framework for performing image clustering from deep embeddings. Our approach jointly learns representations and predicts cluster centers in an end-to-end manner. Our framework performs on par with widely accepted clustering methods and outperforms the state-of-the-art contrastive learning method on the CIFAR-10 dataset.
  arXiv  Detail & Related papers  (2021-09-26T22:18:15Z)
• Clustering by Maximizing Mutual Information Across Views [62.21716612888669]
  We propose a novel framework for image clustering that incorporates joint representation learning and clustering. Our method significantly outperforms state-of-the-art single-stage clustering methods across a variety of image datasets.
  arXiv  Detail & Related papers  (2021-07-24T15:36:49Z)
• Learning to Hash with Graph Neural Networks for Recommender Systems [103.82479899868191]
  Graph representation learning has attracted much attention in supporting high quality candidate search at scale. Despite its effectiveness in learning embedding vectors for objects in the user-item interaction network, the computational costs to infer users' preferences in continuous embedding space are tremendous. We propose a simple yet effective discrete representation learning framework to jointly learn continuous and discrete codes.
  arXiv  Detail & Related papers  (2020-03-04T06:59:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.