SGCL: Semi-supervised Graph Contrastive Learning with confidence propagation algorithm for node classification

Abstract

Semi-Supervised Graph Learning (SSGL) aims to predict massive unknown labels based on a subset of known labels within a graph. Recently, graph neural network, one of the most popular SSGL approaches, has garnered considerable research interest and achieved remarkable progress. However, many of these methods perform unsatisfactorily with limited labeled data. Graph contrastive learning (GCL), which utilizes unlabeled data to generate supervision, partially addresses this issue but does not fully exploit label information. To address this challenge, we propose SSGL algorithm, Semi-supervised Graph Contrastive Learning with Confidence Propagation Algorithm (SGCL). SGCL comprises two stages of contrastive learning. In the first stage, we employ unsupervised contrastive learning to initialize the model with graph augmentation. In the second stage, in order to fully leverage known labels and graph structure, we incorporate supervised contrastive learning which utilizes supervision signals obtained from confidence propagation algorithm. By combining supervised contrastive learning and unsupervised contrastive learning, the embedding quality and the classification accuracy can be further enhanced. At last, comprehensive experiments demonstrate that SGCL outperforms the best baseline method by an average of 2.23% across six datasets, highlighting the effectiveness of our approach.