Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering

doi:10.1109/TKDE.2022.3220948

Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering

2023-09-01

19

OA

AI

DOI：10.1109/TKDE.2022.3220948

Original

Original request for help

Save

Abstract

En 中文

Most recent graph clustering methods have resorted to Graph Auto-Encoders (GAEs) to perform joint clustering and embedding learning. However, two critical issues have been overlooked. First, the accumulative error, inflicted by learning from noisy clustering assignments, degrades the effectiveness of the clustering model. This problem is called Feature Randomness. Second, reconstructing the adjacency matrix sets the model to learn irrelevant similarities for the clustering task. This problem is called Feature Drift. Furthermore, the theoretical relation between the aforementioned problems has not yet been investigated. We study these issues from two aspects: (1) there is a trade-off between Feature Randomness and Feature Drift when clustering and reconstruction are performed at the same level, and (2) the problem of Feature Drift is more pronounced for GAE models, compared with vanilla auto-encoder models. Thus, we reformulate the GAE-based clustering methodology. Our solution is two-fold. First, we propose a sampling operator E that triggers a protection mechanism against Feature Randomness. Second, we propose an operator T that triggers a correction mechanism against Feature Drift by gradually transforming the reconstructed graph into a clustering oriented one. As principal advantages, our solution grants a considerable improvement in clustering effectiveness and can be easily tailored to GAE models.

Keywords:

Unsupervised learning

graph clustering

graph auto-encoders

Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering

Abstract

Journal

Organization