A graph neural network based on feature network for identifying influential nodes
Yanmei Hu, Siyuan Yin, Yihang Wu, Xue Yue, Yue Liu

TL;DR
This paper introduces a novel graph neural network framework called FNGCN that effectively identifies influential nodes in complex networks by considering relationships among local centralities, outperforming existing methods.
Contribution
The paper proposes a new GCN-based framework utilizing feature networks to better capture relationships among centralities for influential node detection.
Findings
FNGCN outperforms state-of-the-art methods in accuracy.
The framework effectively reduces noise and redundancy.
Experimental results validate the approach on real-world networks.
Abstract
Identifying influential nodes in complex networks is of great importance, and has many applications in practice. For example, finding influential nodes in e-commerce network can provide merchants with customers with strong purchase intent; identifying influential nodes in computer information system can help locating the components that cause the system break down and identifying influential nodes in these networks can accelerate the flow of information in networks. Thus, a lot of efforts have been made on the problem of indentifying influential nodes. However, previous efforts either consider only one aspect of the network structure, or using global centralities with high time consuming as node features to identify influential nodes, and the existing methods do not consider the relationships between different centralities. To solve these problems, we propose a Graph Convolutional…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Advanced Graph Neural Networks · Graph Theory and Algorithms
