Finding Key Nodes in Complex Networks via Deep Reinforcement Learning and Multi Attention Node Connectivity
Identifying and safeguarding key nodes is crucial for maintaining the reliability and stability of business functions. Currently, most key node identification algorithms are based on manual or deductive models, which are complex and suboptimal. While deep reinforcement learning algorithms have demonstrated promising practical results, they often exhibit excessive randomness in network feature extraction. To address this challenge, this paper proposes a deep reinforcement learning framework based on multi attributes attention mechanism. This framework extends node attributes to encompass general business scenarios and employs graph convolutional networks combined with an attention mechanism to learn adaptive weights for different attributes of various nodes. Subsequently, reinforcement learning is utilized to determine the sequence of key nodes in the network. This algorithm is compared with six algorithms across six types of networks, consistently achieving optimal results, thereby validating the effectiveness of the proposed approach.
Authors
- Muqing Wu (ORCID: https://orcid.org/0000-0002-9653-4677)
- Kaili Wang (ORCID: https://orcid.org/0009-0004-1664-5943)
- Min Zhao (ORCID: https://orcid.org/0000-0002-7324-9187)
Institutions
- Beijing University of Posts and Telecommunications (CN)
Publication Details
- Published
- 2024-10-28
- DOI
- https://doi.org/10.23919/cnsm62983.2024.10814614
- Citations
- 1
- Primary Topic
- Energy Efficient Wireless Sensor Networks
- Type
- article
- Field-Weighted Citation Impact
- 0.35
Funders
- Ministry of Education
- Beijing Key Laboratory of Network System Architecture and Convergence