Identifying Multiple Influential Nodes for Complex Networks Based on Multi-agent Deep Reinforcement Learning

被引:0
作者
Kong, Shengzhou [1 ]
He, Langzhou [2 ]
Zhang, Guilian [1 ]
Tao, Li [1 ]
Zhang, Zili [1 ]
机构
[1] Southwest Univ, Coll Hanhong, Chongqing 400715, Peoples R China
[2] Southwest Univ, Coll Comp & Informat Sci, Chongqing 400715, Peoples R China
来源
PRICAI 2022: TRENDS IN ARTIFICIAL INTELLIGENCE, PT III | 2022年 / 13631卷
关键词
Multiple influential nodes; Multi-agent deep reinforcement learning; Multi-agent identification framework; Complex networks; IDENTIFICATION;
D O I
10.1007/978-3-031-20868-3_9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The identification of multiple influential nodes that influence the structure or function of a complex network has attracted much attention in recent years. Distinguished from individual significant nodes, the problem of overlapping spheres of influence among influential nodes becomes a key factor that hinders their identification. Most approaches artificially specify the spacing distance between selected nodes through graph coloring and greedy selection. However, these approaches either fail to find the best combination accurately or have high complexity. Therefore, we propose a novel identification framework, namely multi-agent identification framework (MAIF), which selects multiple influential nodes in a distributed and simultaneous manner. Based on multi-agent deep reinforcement learning, the framework introduce several optimization models and extend to complex networks to solve distributed problems. With sufficient training, MAIF can be applied to real-world problems quickly and effectively, and perform well in large-scale networks. Based on SIR model-based simulations, the effectiveness of MAIF is evaluated and compared with three baseline methods. The experimental results show that MAIF outperforms the baselines on all four real-world networks. This implies using multiple agents to find multiple influential nodes in a distributed manner is an efficient and accurate new way to differentiate from the greedy methods.
引用
收藏
页码:120 / 133
页数:14
相关论文
共 35 条
[1]   Identifying influential nodes in complex networks [J].
Chen, Duanbing ;
Lu, Linyuan ;
Shang, Ming-Sheng ;
Zhang, Yi-Cheng ;
Zhou, Tao .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) :1777-1787
[2]   A survey on multi-agent deep reinforcement learning: from the perspective of challenges and applications [J].
Du, Wei ;
Ding, Shifei .
ARTIFICIAL INTELLIGENCE REVIEW, 2021, 54 (05) :3215-3238
[3]  
Dudkina E., 2021, ARXIV
[4]   Finding key players in complex networks through deep reinforcement learning [J].
Fan, Changjun ;
Zeng, Li ;
Sun, Yizhou ;
Liu, Yang-Yu .
NATURE MACHINE INTELLIGENCE, 2020, 2 (06) :317-324
[5]  
Foerster JN, 2016, ADV NEUR IN, V29
[6]  
Foerster JN, 2018, AAAI CONF ARTIF INTE, P2974
[7]  
Gao Y., 2016, Proceedings of the 8th Asian conference on machine learning, P350
[8]  
Gomez S., 2019, BUSINESS CONSUMER AN, P401, DOI [DOI 10.1007/978-3-030-06222-4_8, DOI 10.1007/978-3-030-06222-48]
[9]   Multi-agent deep reinforcement learning: a survey [J].
Gronauer, Sven ;
Diepold, Klaus .
ARTIFICIAL INTELLIGENCE REVIEW, 2022, 55 (02) :895-943
[10]   Influential Nodes Identification in Complex Networks via Information Entropy [J].
Guo, Chungu ;
Yang, Liangwei ;
Chen, Xiao ;
Chen, Duanbing ;
Gao, Hui ;
Ma, Jing .
ENTROPY, 2020, 22 (02)