A graph neural network based on feature network for identifying influential nodes

• URL: http://arxiv.org/abs/2508.01278v1
• Date: Sat, 02 Aug 2025 09:15:52 GMT
• Title: A graph neural network based on feature network for identifying influential nodes
• Authors: Yanmei Hu, Siyuan Yin, Yihang Wu, Xue Yue, Yue Liu,
• Abstract summary: We propose a Graph Convolutional Network Framework based on Feature Network, abbreviated as FNGCN.<n>By taking a shallow GCN and a deep GCN into the FNGCN framework, two FNGCNs are developed.<n> Experimental results show that the two FNGCNs can identify the influential nodes more accurately than the compared methods.
• Score: 6.536533643444211
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 Network Framework based on Feature Network, abbreviated as FNGCN (graph convolutional network is abbreviated as GCN in the following text). Further, to exclude noises and reduce redundency, FNGCN utilizes feature network to represent the complicated relationships among the local centralities, based on which the most suitable local centralities are determined. By taking a shallow GCN and a deep GCN into the FNGCN framework, two FNGCNs are developed. With ground truth obtained from the widely used Susceptible Infected Recovered (SIR) model, the two FNGCNs are compared with the state-of-art methods on several real-world networks. Experimental results show that the two FNGCNs can identify the influential nodes more accurately than the compared methods, indicating that the proposed framework is effective in identifying influential nodes in complex networks.

Related papers

• Opportunistic Routing in Wireless Communications via Learnable State-Augmented Policies [7.512221808783587]
  This paper addresses the challenge of packet-based information routing in large-scale wireless communication networks.<n>Opportunistic routing exploits the broadcast nature of wireless communication to dynamically select optimal forwarding nodes.<n>We propose a State-Augmentation (SA) based distributed optimization approach aimed at maximizing the total information handled by the source nodes in the network.
  arXiv  Detail & Related papers  (2025-03-05T18:44:56Z)
• Multi-perspective Memory Enhanced Network for Identifying Key Nodes in Social Networks [51.54002032659713]
  We propose a novel Multi-perspective Memory Enhanced Network (MMEN) for identifying key nodes in social networks. MMEN mines key nodes from multiple perspectives and utilizes memory networks to store historical information. Our method significantly outperforms previous methods.
  arXiv  Detail & Related papers  (2024-03-22T14:29:03Z)
• Domain-adaptive Message Passing Graph Neural Network [67.35534058138387]
  Cross-network node classification (CNNC) aims to classify nodes in a label-deficient target network by transferring the knowledge from a source network with abundant labels. We propose a domain-adaptive message passing graph neural network (DM-GNN), which integrates graph neural network (GNN) with conditional adversarial domain adaptation.
  arXiv  Detail & Related papers  (2023-08-31T05:26:08Z)
• Collaborative Graph Neural Networks for Attributed Network Embedding [63.39495932900291]
  Graph neural networks (GNNs) have shown prominent performance on attributed network embedding. We propose COllaborative graph Neural Networks--CONN, a tailored GNN architecture for network embedding.
  arXiv  Detail & Related papers  (2023-07-22T04:52:27Z)
• Learning to Detect Critical Nodes in Sparse Graphs via Feature Importance Awareness [53.351863569314794]
  The critical node problem (CNP) aims to find a set of critical nodes from a network whose deletion maximally degrades the pairwise connectivity of the residual network. This work proposes a feature importance-aware graph attention network for node representation. It combines it with dueling double deep Q-network to create an end-to-end algorithm to solve CNP for the first time.
  arXiv  Detail & Related papers  (2021-12-03T14:23:05Z)
• Identifying Influential Nodes in Two-mode Data Networks using Formal Concept Analysis [0.0]
  Bi-face (BF) is a new bipartite centrality measurement for identifying important nodes in two-mode networks. Unlike off-the shelf centrality indices, it quantifies how a node has a cohesive-substructure influence on its neighbour nodes via bicliques. Our experiments on several real-world and synthetic networks show the efficiency of BF over existing prominent bipartite centrality measures.
  arXiv  Detail & Related papers  (2021-09-07T23:57:05Z)
• Predicting Critical Nodes in Temporal Networks by Dynamic Graph Convolutional Networks [1.213512753726579]
  It is difficult to identify critical nodes because the network structure changes over time in temporal networks. This paper proposes a novel and effective learning framework based on the combination of special GCNs and RNNs. Experimental results on four real-world temporal networks demonstrate that the proposed method outperforms both traditional and deep learning benchmark methods.
  arXiv  Detail & Related papers  (2021-06-19T04:16:18Z)
• AM-GCN: Adaptive Multi-channel Graph Convolutional Networks [85.0332394224503]
  We study whether Graph Convolutional Networks (GCNs) can optimally integrate node features and topological structures in a complex graph with rich information. We propose an adaptive multi-channel graph convolutional networks for semi-supervised classification (AM-GCN) Our experiments show that AM-GCN extracts the most correlated information from both node features and topological structures substantially.
  arXiv  Detail & Related papers  (2020-07-05T08:16:03Z)
• Graph Prototypical Networks for Few-shot Learning on Attributed Networks [72.31180045017835]
  We propose a graph meta-learning framework -- Graph Prototypical Networks (GPN) GPN is able to perform textitmeta-learning on an attributed network and derive a highly generalizable model for handling the target classification task.
  arXiv  Detail & Related papers  (2020-06-23T04:13:23Z)
• Adversarial Deep Network Embedding for Cross-network Node Classification [27.777464531860325]
  Cross-network node classification leverages the abundant labeled nodes from a source network to help classify unlabeled nodes in a target network. In this paper, we propose an adversarial cross-network deep network embedding model to integrate adversarial domain adaptation with deep network embedding. The proposed ACDNE model achieves the state-of-the-art performance in cross-network node classification.
  arXiv  Detail & Related papers  (2020-02-18T04:30:43Z)
• Feature-Attention Graph Convolutional Networks for Noise Resilient Learning [20.059242373860013]
  We propose FA-GCN, a feature-attention graph convolution learning framework, to handle networks with noisy and sparse node content. Experiments and validations, w.r.t. different noise levels, demonstrate that FA-GCN achieves better performance than state-of-the-art methods on both noise-free and noisy networks.
  arXiv  Detail & Related papers  (2019-12-26T02:51:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.