LoyalDE: Improving the performance of Graph Neural Networks with loyal node discovery and emphasis

• Published in: Neural networks 2023-07, Vol.164, p.719-730
• Main Authors: Wei, Haotong, Zhu, Yinlin, Li, Xunkai, Jiang, Bin
• Format: Article
• Language: English
• Subjects: Graph Neural Networks; Graph Supervision Loyalty; Information Management; Neural Networks, Computer; Semi-supervised Node Classification; Supervised Machine Learning
• ISSN: 0893-6080; 1879-2782
• DOI: 10.1016/j.neunet.2023.05.023

Recent years have witnessed an increasing focus on graph-based semi-supervised learning with Graph Neural Networks (GNNs). Despite existing GNNs having achieved remarkable accuracy, research on the quality of graph supervision information has inadvertently been ignored. In fact, there are significant differences in the quality of supervision information provided by different labeled nodes, and treating supervision information with different qualities equally may lead to sub-optimal performance of GNNs. We refer to this as the graph supervision loyalty problem, which is a new perspective for improving the performance of GNNs. In this paper, we devise FT-Score to quantify node loyalty by considering both the local feature similarity and the local topology similarity, and nodes with higher loyalty are more likely to provide higher-quality supervision. Based on this, we propose LoyalDE (Loyal Node Discovery and Emphasis), a model-agnostic hot-plugging training strategy, which can discover potential nodes with high loyalty to expand the training set, and then emphasize nodes with high loyalty during model training to improve performance. Experiments demonstrate that the graph supervision loyalty problem will fail most existing GNNs. In contrast, LoyalDE brings about at most 9.1% performance improvement to vanilla GNNs and consistently outperforms several state-of-the-art training strategies for semi-supervised node classification.