Skip to content
Open access

Weighted Deep Embedded Clustering for Robust Representation Learning in Noisy Data

Aug 2026 · Algorithms · 0 citations · 18 references

TL;DR

A Reliability-Based Deep Embedded Clustering (RDEC) approach that improves clustering reliability through a novel distance-aware weighting strategy, coupled with a novel Kullback–Leibler divergence objective function to focus on the most representative data instances and guide the clustering process.

Abstract

Deep clustering methods effectively learn meaningful representations from unlabeled data. Typically, existing approaches treat all samples equally during training, which can lead to unstable clustering in the presence of noise and outliers. In this research, we propose a Reliability-Based Deep Embedded Clustering (RDEC) approach that improves clustering reliability through a novel distance-aware weighting strategy. Specifically, rather than assigning equal importance to all samples, RDEC estimates and exploits the typicality of each instance according to its distance from the cluster centers in the latent space. Accordingly, samples that lie closer to cluster centers are assigned higher weights, while distant, atypical and ambiguous samples are gradually down-weighted using an inverse polynomial function. Moreover, the proposed weighting approach is coupled with a novel Kullback–Leibler divergence objective function to focus on the most representative data instances and guide the clustering process. Furthermore, the resulting latent distances and reliability weights demonstrate that RDEC effectively distinguishes reliable samples from noisy ones, resulting in more stable clustering behavior. RDEC was evaluated on three benchmark image datasets, namely MNIST, USPS, and Fashion-MNIST, under both clean conditions and controlled image corruption settings, including semantic outliers and synthetic perturbations, to assess its robustness during clustering. The experimental results demonstrated that RDEC achieved competitive clustering performance compared with representative clustering methods evaluated under the same experimental setting. In particular, RDEC yielded the best overall performance on the clean USPS dataset, attaining an ACC, NMI, and ARI of 0.8079, 0.7714, and 0.7392, respectively. Moreover, on the clean Fashion-MNIST dataset, RDEC achieved the highest NMI and ARI while maintaining competitive clustering accuracy, demonstrating its effectiveness on a more challenging clustering benchmark. Under these controlled image corruption scenarios, RDEC consistently achieved strong clustering performance across multiple corruption levels on MNIST, USPS, and Fashion-MNIST datasets, demonstrating the effectiveness of the proposed reliability-aware weighting mechanism under diverse image characteristics. The present study focuses on robustness under controlled image-based corruption scenarios, with the evaluation limited to benchmark image datasets.

Read PDF

Similar papers

Open access Sep 2026

Robust deep subspace clustering based on unsupervised fusion learning

A flexible encoder based on low-rank embedding that adaptively captures the most informative components in the feature space of the input data while filtering out redundant or noisy information, effectively alleviating over-connected affinities is proposed.

Li Guo, Qian Wang · 0 citations
Conference Open access Sep 2026

Salient-Residual Decoupled Multi-View Learning for Clustering

This paper proposes salient-residual decoupled multi-view learning for clustering, SRDMVC, introducing a novel decomposition-fusion iterative optimization, which separates the feature space into a salient space and a residual subspace effectively and fuses them using a novel attention mechanism.

Gao-Kai Wang, Yazhou Ren, Feng-Yu Zhang et al. · 0 citations
Preprint Aug 2026

Uncertainty-Aware Ensemble Deep Randomized Neural Networks for Classification

Extensive experiments conducted on UCI and KEEL benchmark datasets demonstrate the superiority of the proposed IF-dRVFL and IF-edRVFL models over existing SOTA fuzzy and non-fuzzy approaches.

M. Sajid, A. Quadir, A. Rahaman et al. · 0 citations
Book Open access Aug 2026

Deep Multiple Clustering: From Foundations to Context-Aware Approaches

This tutorial explains why real-world datasets often inherently possess multiple latent structures and demonstrate how deep multiple clustering methods uncover these alternative perspectives, and critically discuss evaluation metrics for clustering quality and diversity.

Bangyu Zou, Jiawei Yao, Hui-Ji Gao et al. · 0 citations
Preprint Jul 2026

Ensemble of Unsupervised Deep Learning for Clustering Imbalanced Tabular Data

Two novel cluster ensemble approaches are introduced: one aggregates deep clustering assignments across different embedding dimensions, and the other applies majority voting to the best-performing clustering algorithms.

Pulock Das, Yina Hou, Md. Kamrozzaman Bhuiyan et al. · 0 citations
Conference Open access Sep 2026

Dual-Topology Learning with Adaptive Anchors for Multi-View Clustering

The Dual-tOpology learning with adapTive Anchors (DOTA) is proposed, which not only learns the sample-anchor relationship but also preserves the topology structure among anchors, significantly enhancing the discriminability of learned representation while preserving the underlying data manifold.

Cheng-Long Zhang, Chao Zhang, Jun-Hao Zhang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.