Affiliations: [a] Department of Computer Science and Technology, Nanjing University, Nanjing, Jiangsu, China | [b] National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China
Correspondence:
[*]
Corresponding author: Chongjun Wang, Department of Computer Science and Technology, Nanjing University, Nanjing, Jiangsu, China. E-mail: chjwang@nju.edu.cn.
Abstract: Graph Neural Networks (GNNs) have achieved remarkable success in graph-related tasks by combining node features and graph topology elegantly. Most GNNs assume that the networks are homophilous, which is not always true in the real world, i.e., structure noise or disassortative graphs. Only a few works focus on generalizing graph neural networks to heterophilous or low homophilous networks, where connected nodes may have different labels. In this paper, we design a simple and effective Graph Structure Learning strategy based on Feature and Label consistency (GSLFL) to increase the homophilous level of networks for generalizing any existing GNNs to heterophilous networks. Specifically, we first introduce a method to learn graph structure based on node features and then modify the graph structure based on label consistency. Further, we combine the GSLFL with three existing GNNs to learn node representations and graph structure together. And we design a self-training method to iteratively train models and modify graph structure with pseudo-labels. Finally, our empirical results on 6 public networks with homophily or heterophily, and structure attacks show that our methods outperform the state-of-the-art methods in most cases.
