.png){kind=icon}
.png){kind=icon}
Return
SDAC-DA: Semi-Supervised Deep Attributed Clustering Using Dual Autoencoder
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2024.3389049.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Attributed graph clustering aims to group nodes into disjoint categories using deep learning to represent node embeddings and has shown promising performance across various applications. However, two main challenges hinder further performance improvement. First, reliance on unsupervised methods impedes the learning of low-dimensional, clustering-specific features in the representation layer, thus impacting clustering performance. Second, the predominant use of separate approaches leads to suboptimal learned embeddings that are insufficient for subsequent clustering steps. To address these limitations, we propose a novel method called Semi-supervised Deep Attributed Clustering using Dual Autoencoder (SDAC-DA). This approach enables semi-supervised deep end-to-end clustering in attributed networks, promoting high structural cohesiveness and attribute homogeneity. SDAC-DA transforms the attribute network into a dual-view network, applies a semi-supervised autoencoder layering approach to each view, and integrates dimensionality reduction matrices by considering complementary views. The resulting representation layer contains high clustering-friendly embeddings, which are optimized through a unified end-to-end clustering process for effectively identifying clusters. Extensive experiments on both synthetic and real networks demonstrate the superiority of our proposed method over seven state-of-the-art approaches.
Keywords:
Vectors
Clustering algorithms
Image edge detection
Clustering methods
Transforms
Task analysis
STEM
Attributed network
deep attributed clustering
semi-supervised clustering
pairwise constraints
Journal
IF:
10.4
Papers:
6.7K
Citations:
3.2W