Deep Attention-guided Graph Clustering with Dual Self-supervision

Abstract

Existing deep embedding clustering works only consider the deepest layer to learn a feature embedding and thus fail to well utilize the available discriminative information from cluster assignments, resulting performance limitation. To this end, we propose a novel method, namely deep attention-guided graph clustering with dual self-supervision (DAGC). Specifically, DAGC first utilizes a heterogeneity-wise fusion module to adaptively integrate the features of an auto-encoder and a graph convolutional network in each layer and then uses a scale-wise fusion module to dynamically concatenate the multi-scale features in different layers. Such modules are capable of learning a discriminative feature embedding via an attention-based mechanism. In addition, we design a distribution-wise fusion module that leverages cluster assignments to acquire clustering results directly. To better explore the discriminative information from the cluster assignments, we develop a dual self-supervision solution consisting of a soft self-supervision strategy with a triplet Kullback-Leibler divergence loss and a hard self-supervision strategy with a pseudo supervision loss. Extensive experiments validate that our method consistently outperforms state-of-the-art methods on six benchmark datasets. Especially, our method improves the ARI by more than 18.14% over the best baseline.

arXiv commentAccepted by IEEE TCSVT

References in corpus (7)

• Semi-Supervised Classification with Graph Convolutional Networks
• Graph Embedding Techniques, Applications, and Performance: A Survey
• Variational Graph Auto-Encoders
• Learning Graph Embedding with Adversarial Training Methods
• How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision
• Combining Label Propagation and Simple Models Out-performs Graph Neural Networks
• Maximum Entropy Subspace Clustering Network