-
识别复杂网络中的传播关键节点在加速信息扩散、抑制病毒或谣言的传播等应用中至关重要. 现有识别网络传播中关键节点的方法各有局限: 复杂网络中心性方法仅从局域或者全局拓扑结构预测节点影响力; 传统机器学习和深度学习方法不适用于图结构数据; 已有基于图神经网络的方法忽视了传播过程自身的动力学特性. 鉴于此, 本文提出一种融合传播过程动力学特征与节点局域结构的传播动态图神经网络(propagation dynamics graph neural network, PDGNN), 用于识别复杂网络传播中的关键节点. 通过结合易感-感染-恢复传播模型, 提取节点传播过程中的动态感染特征, 构建高维特征向量并设计优化的损失函数, 以实现对复杂网络传播关键节点的准确识别. 在2个合成网络和7个真实网络上的实验结果表明, PDGNN在复杂网络传播关键节点识别准确性上优于经典的中心性方法、基于传统机器学习和深度学习的方法以及现有的基于图神经网络的方法.Identifying the most influential nodes in the spreading process in complex networks is crucial in many applications, such as accelerating the diffusion of information and suppressing the spread of viruses or rumors. Existing methods of identifying influential spreaders have their limitations. Specifically speaking, classical network centrality methods rely solely on local or global topology to predict node influence; traditional machine learning and deep learning methods are not suitable for graph-structured data; existing graph neural network-based methods neglect the dynamic characteristics of the propagation process itself. Researchers have pointed out that the spreading influence of nodes not only depends on their structural location, but is also significantly influenced by the dynamics of the spreading process itself. In this work, we propose a propagation dynamics graph neural network (PDGNN) that integrates the dynamic features of the propagation process and the structural features of nodes to identify influential nodes. Specifically speaking, based on the susceptible-infected-recovered (SIR) propagation model, the dynamic infection features and potential infection capacity of nodes are extracted from the epidemic spreading process. Then a high-dimensional feature vector of each node consisting of the embedding and degree of its local transmission tree, as well as its dynamics-sensitive centrality is constructed and used as the input to the graph neural network. To deal with the problem of imbalanced numbers between critical nodes and non-critical nodes in training the model and optimizing the output, an optimized loss function is designed, which combines focal loss with mean squared error. Experimental results in two synthetic networks and seven real-world networks show that the PDGNN outperforms classical centrality methods, traditional machine learning and deep learning-based methods, and existing graph neural network-based methods in identifying influential nodes in the spreading process in complex networks. The performance of PDGNN is robust when the infection rate and the size of the training set change. In a wide range of infection rates, the proposed PDGNN can accurately identify influential spreaders. Despite the fact that the training set accounts for 30% of the total dataset, the PDGNN has the smallest inaccuracy in all nine studied networks.
-
Keywords:
- complex networks /
- influential nodes /
- graph neural network /
- local transmission tree
[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] -
网络 $ \left|N\right| $ $ \left|E\right| $ $ \langle k \rangle $ $ k_{{\mathrm{max}}} $ c $ \beta_{\mathrm{c}} $ Musae_chameleon 2277 31371 27. 555 732 0. 481 0. 036 Router 5022 6258 2. 492 106 0. 012 0. 401 Blogs 3982 6803 3. 417 189 0. 284 0. 293 Jazz 198 2742 27. 69 78 0. 242 0. 036 Celegans 295 2244 15. 214 116 0. 189 0. 066 Ca-netscience 379 914 4. 823 34 0. 741 0. 207 CollegeMsg 1893 13835 14. 62 255 0. 109 0. 068 SCF1 1000 2991 5. 982 99 0. 032 0. 167 SCF2 2000 8997 8. 997 43 0. 009 0. 111 Networks SVM CGNN RF PDGNN Recall PR_AUC Recall PR_AUC Recall PR_AUC Recall PR_AUC Musae_chameleon 0 3603 0.3603 0 0.378 0 0.2667 0.9524 0.3991 Router 0.4048 0.7776 0.3864 0.603 0.4762 0.7714 1 0.8761 Blogs 0.5897 0.8095 0.4651 0.6582 0.3333 0.7134 1 0.9089 Jazz 0 1 0 0.1843 0.5 1 1 1 Celegans 0.6 0.75 0 0 0.2 0.3333 1 0.8889 Ca-netscience 0.1667 0.7452 0 0.1607 0 0.6389 1 1 CollegeMsg 0.1579 0.5673 0.125 0.2968 0.0526 0.6965 1 0.6431 SCF1 0.2 0.5741 0.6 0.7783 0.2 0.4792 1 0.9709 SCF2 0.4091 0.8158 0.2268 0.7653 0.1818 0.8002 1 0.8837 -
[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40]
计量
- 文章访问数: 604
- PDF下载量: 31
- 被引次数: 0