View in EDS

GNR: A universal and efficient node ranking model for various tasks based on graph neural networks.

Saved in:
Bibliographic Details
Title: GNR: A universal and efficient node ranking model for various tasks based on graph neural networks.
Authors: Qu, Hongbo1 (AUTHOR), Song, Yu-Rong1,2 (AUTHOR) songyr@njupt.edu.cn, Li, Ruqi1 (AUTHOR), Li, Min2 (AUTHOR)
Source: Physica A. Dec2023:Part 2, Vol. 632, pN.PAG-N.PAG. 1p.
Subjects: Spreading cortical depression, Infection
Abstract: Node ranking is an essential problem in complex networks, which aims to identify influential or central nodes in a graph. Existing methods for node ranking are either computationally expensive or suboptimal for different networks and multiple tasks. In this paper, we propose GNR, a graph neural network-based node ranking model that can sort nodes quickly and efficiently for any type of networks. To achieve this, GNR takes into account three factors to calculate the importance of nodes and train the model: degree, infection score, and dismantling score, which capture the local and global structure of the network and the effect of nodes on network propagation and dismantling. We conduct extensive experiments on 16 real networks, and compare GNR with other centrality-based node ranking models on three tasks: network dismantling, virus propagation, and information spreading. The results show that GNR performs better in most cases and validates the effectiveness and superiority of our model. • Proposing a graph neural network-based node ranking model. • GNR fuses different node importance metrics for generality. • GNR is efficient and scalable for any type of networks. • GNR outperforms other centrality-based methods in various tasks. [ABSTRACT FROM AUTHOR]
Copyright of Physica A is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Node ranking is an essential problem in complex networks, which aims to identify influential or central nodes in a graph. Existing methods for node ranking are either computationally expensive or suboptimal for different networks and multiple tasks. In this paper, we propose GNR, a graph neural network-based node ranking model that can sort nodes quickly and efficiently for any type of networks. To achieve this, GNR takes into account three factors to calculate the importance of nodes and train the model: degree, infection score, and dismantling score, which capture the local and global structure of the network and the effect of nodes on network propagation and dismantling. We conduct extensive experiments on 16 real networks, and compare GNR with other centrality-based node ranking models on three tasks: network dismantling, virus propagation, and information spreading. The results show that GNR performs better in most cases and validates the effectiveness and superiority of our model. • Proposing a graph neural network-based node ranking model. • GNR fuses different node importance metrics for generality. • GNR is efficient and scalable for any type of networks. • GNR outperforms other centrality-based methods in various tasks. [ABSTRACT FROM AUTHOR]
ISSN:03784371
DOI:10.1016/j.physa.2023.129339