arrow
Return

Exploring structural components in autoencoder-based data clustering

delete2025-01-01
delete0
PRE
AI
S
Sujoy Chatterjee
S
Suvra Jyoti Choudhury *
DOI:10.1016/j.engappai.2024.109562delete
deleteOriginal
deleteShare
deleteSave
Abstract

Abstract

En 中文
Clustering is a fundamental machine-learning task that has received extensive popularity in the literature. The foundational tenet of traditional clustering approaches is that data are learned to be vectorized features through various representational learning techniques. The conventional clustering methods can no longer manage the high-dimensional data as the data gets more intricate. Numerous representational learning strategies using deep architectures have been presented over the years, particularly deep unsupervised learning due to its superiority over conventional approaches. Inmost existing research, especially in the autoencoderbased approaches, only the distance information of pair-of-points in the original data space is retained in the latent space. However, combining this with additional preserving factors like the variance and independent component in the original data and latent space, respectively, is important. In addition, the model's stability under noisy conditions is crucial. This paper provides a unique method for clustering data that combines autoencoder (AE), principal component analysis (PCA), and independent component analysis (ICA) to capture a relevant latent space representation. A further aid in lowering the dimensionality to improve clustering effectiveness is employing two-dimensional reduction algorithms, i.e., PCA and t-distributed stochastic neighbor embedding (t-SNE). The proposed technique produces more precise and reliable clustering by utilizing the advantages of both approaches. To compare the efficiency of the proposed methods to conventional clustering methods and stand-alone autoencoders, we conduct comprehensive experiments on 13 real-life datasets. The outcomes demonstrate the approach's intriguing potential for addressing complicated clustering problems, and importantly, effectiveness is demonstrated even under noisy conditions.
Keywords:
Clustering
Latent space representation
Neural networks
Sammon's stress
Principal Component Analysis
Independent Component Analysis

Journal

Engineering Applications of Artificial Intelligence cover
Engineering Applications of Artificial Intelligence
IF:
8
Papers:
5.9K
Citations:
4.2W

Organization

I
iiit nagpur
Scholars:
1
Papers: 1
Citations: 0
U
Univ Campinas UNICAMP
Scholars:
305
Papers: 110
Citations: 216
Cited Papers

Cited Papers

Numerical Method Using Cubic B-Spline for a Strongly Coupled Reaction-Diffusion System
err2014-01-10
err0
errOAAI
errMuhammad Abbas; Ahmad Abd. Majid; Ahmad Izani Md. Ismail; Abdur Rashid
errShare
errSave
Deep Clustering With Variational Autoencoder
err2020-01-01
err74
PREAI
errLim, Kart-Leong; Jiang, Xudong; Yi, Chenyu
errShare
errSave
Autoencoder-based feature construction for IoT attacks clustering
err2022-02-01
err14
PREAI
errHaseeb, Junaid; Mansoori, Masood; Hirose, Yuichi; Al-Sahaf, Harith; Welch, Ian
errShare
errSave
Structure enhanced deep clustering network via a weighted neighbourhood auto-encoder
err2022-11-01
err15
PREAI
errBai, Ruina; Huang, Ruizhang; Zheng, Luyi; Chen, Yanping; Qin, Yongbin
errShare
errSave
researcher View more