Multi-channel set polynomial based label regularized graph neural networks against extreme data scarcity

Graph Neural Networks (GNNs) are one of the commonly used methods for semi-supervised node classification. Their advantage lies in modeling the relational information in the data and propagating the feature information of labeled nodes to unlabeled nodes in the graph, thereby predicting their labels. However, current research results indicate that existing models perform poorly when labeled data are extremely limited. To address this problem, we introduce a label regularization method and propose a multi-channel set polynomial based label regularized graph neural network against extreme data scarcity (MSP-LR). It consists of two components: a basic learning module based on multi-channel set polynomials and a label regularization module. Specifically, we use the basic module to expand the model's receptive field and obtain pseudo-labels for all nodes. For labeled nodes, we replace the obtained pseudo-label information with their initial label information. In the label regularization module, we impose regularization constraints on unlabeled nodes based on the clustering assumption to improve the reliability of labels. Experimental results on two homogeneous graphs and four heterogeneous graphs with different labeling rates demonstrate the effectiveness of this model.