Embedding Graph Auto-Encoder for Graph Clustering
Graph clustering, aiming to partition nodes of a graph into various groups via an unsupervised approach, is an attractive topic in recent years. To improve the representative ability, several graph auto-encoder (GAE) models, which are based on semi-supervised graph convolution networks (GCN), have been developed and they achieve good results compared with traditional clustering methods. However, all existing methods either fail to utilize the orthogonal property of the representations generated by GAE, or separate the clustering and the learning of neural networks. We first prove that the relaxed k-means will obtain an optimal partition in the inner-products used space. Driven by theoretical analysis about relaxed k-means, we design a specific GAE-based model for graph clustering to be consistent with the theory, namely Embedding Graph Auto-Encoder (EGAE). Meanwhile, the learned representations are well explainable such that the representations can be also used for other tasks. To further induce the neural network to produce deep features that are appropriate for the specific clustering model, the relaxed k-means and GAE are learned simultaneously. Therefore, the relaxed k-means can be equivalently regarded as a decoder that attempts to learn representations that can be linearly constructed by some centroid vectors. Accordingly, EGAE consists of one encoder and dual decoders. Extensive experiments are conducted to prove the superiority of EGAE and the corresponding theoretical analyses.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDecoderGraph ClusteringMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Transforming Graphs for Enhanced Attribute Clustering: An Innovative Graph Transformer-Based Method
Graph Representation Learning (GRL) is an influential methodology, enabling a more profound understanding of graph-structured data and aiding graph clustering, a critical task across various domains. The recent incursion…
AttributeClusteringGraph AttentionGraph Clustering+4Masked AutoEncoder for Graph Clustering without Pre-defined Cluster Number k
Graph clustering algorithms with autoencoder structures have recently gained popularity due to their efficient performance and low training cost. However, for existing graph autoencoder clustering algorithms based on GCN…
ClusteringDecoderGraph ClusteringAdaptive Graph Auto-Encoder for General Data Clustering
Graph-based clustering plays an important role in the clustering area. Recent studies about graph convolution neural networks have achieved impressive success on graph type data. However, in general clustering tasks, the…
ClusteringDecoderGraph EmbeddingNetwork EmbeddingDeep Clustering by Gaussian Mixture Variational Autoencoders With Graph Embedding
We propose DGG: D eep clustering via a G aussian-mixture variational autoencoder (VAE) with G raph embedding. To facilitate clustering, we apply Gaussian mixture model (GMM) as the prior in VAE. To handle data with co…
ClusteringDeep ClusteringGraph EmbeddingRepresentation LearningLearning Graph Embedding with Adversarial Training Methods
Graph embedding aims to transfer a graph into vectors to facilitate subsequent graph analytics tasks like link prediction and graph clustering. Most approaches on graph embedding focus on preserving the graph structure o…
ClusteringDecoderGraph ClusteringGraph Embedding+2