GAN-based self-supervised message passing graph representation learning

Abstract

Graph representation learning aims to learn embedding representations of nodes in graph-structured data through supervised or unsupervised methods. However, for unlabeled or sparsely labeled graph datasets, conventional supervised approaches fail to perform adequately, and existing unsupervised methods have difficulty achieving high accuracy on multiple downstream tasks such as node classification and link prediction at lower embedding dimensions. To address this issue, we propose a novel self-supervised graph representation learning approach called GAN-based Message Passing Graph Representation Learning. This approach significantly improves the accuracy of node embeddings without relying on label information. Specifically, GMP-GL has developed a generator based on neighbor-weighted random walk to obtain positive and negative node sample pairs, as well as a discriminator that distinguishes whether a real connection exists between node pairs. Through adversarial learning, GMP-GL automatically learns node embeddings. Furthermore, GMP-GL optimizes the training outcomes of the generative adversarial model through self-supervised embedding aggregation learning, thus introducing rich structural information from the graph for the subsequent rounds of generative adversarial training. In addition, GMP-GL employs multiple autoencoders to generate and filter original embeddings, ensuring that the pre-embeddings preserve a significant amount of original feature information for formal learning. The study selects six real-world datasets and conducts comparative experiments with ten SOTA baseline methods. The experimental results demonstrate that the proposed model not only surpasses previous unsupervised methods but also matches or even exceeds the performance of supervised methods. This indicates the great potential of the proposed approach for representation learning tasks on unlabeled graph datasets and its effective applicability to real-world problems.