Graph neural networks (GNNs) are widely utilized to capture the information spreading patterns in graphs. While remarkable performance has been achieved, there is a new trending topic of evaluating node influence. We propose a new method of evaluating node influence, which measures the prediction change of a trained GNN model caused by removing a node. A real-world application is, "In the task of predicting Twitter accounts' polarity, had a particular account been removed, how would others' polarity change?". We use the GNN as a surrogate model whose prediction could simulate the change of nodes or edges caused by node removal. Our target is to obtain the influence score for every node, and a straightforward way is to alternately remove every node and apply the trained GNN on the modified graph to generate new predictions. It is reliable but time-consuming, so we need an efficient method. The related lines of work, such as graph adversarial attack and counterfactual explanation, cannot directly satisfy our needs, since their problem settings are different. We propose an efficient, intuitive, and effective method, NOde-Removal-based fAst GNN inference (NORA), which uses the gradient information to approximate the node-removal influence. It only costs one forward propagation and one backpropagation to approximate the influence score for all nodes. Extensive experiments on six datasets and six GNN models verify the effectiveness of NORA. Our code is available at https://github.com/weikai-li/NORA.git.
School of Computer Science and Technology / School of Artificial Intelligence, China University of Mining and Technology(中国矿业大学计算机科学与技术学院/人工智能学院);Mine Digitization Engineering Research Center of the Ministry of Education(教育部矿山数字化工程研究中心);Jiangsu Provincial Industrial Technology Engineering Center for Intelligent Sensing and Emergency IoT in Underground Space(江苏省地下空间智能传感与应急物联网产业技术工程中心);School of Electrical Engineering and Computer Science, University of Ottawa(渥太华大学电气工程与计算机科学学院)
A Preference Random Walk Algorithm for Link Prediction through Mutual Influence Nodes in Complex Networks
Queensland University of Technology(昆士兰科技大学);Azarbaijan Shahid Madani University(阿塞拜疆沙希德·马达尼大学);University of Applied Science and Technology(应用科学与技术大学)
Online Influence Maximization under the Independent Cascade Model with Node-Level Feedback
Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学);Microsoft Research Asia(微软亚洲研究院)