基于三角递归压缩的多智能体网络分层影响节点识别

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Yonggang Li , Zhili Xiao , Ang Gao , Weinong Wu , Errong Pei
{"title":"基于三角递归压缩的多智能体网络分层影响节点识别","authors":"Yonggang Li ,&nbsp;Zhili Xiao ,&nbsp;Ang Gao ,&nbsp;Weinong Wu ,&nbsp;Errong Pei","doi":"10.1016/j.knosys.2025.113434","DOIUrl":null,"url":null,"abstract":"<div><div>The identification of influential nodes in complex networks is a core research topic in the field of network science. Existing methods often rely on the topological features of static networks, which struggle to fully capture the characteristics of nodes in dynamic networks. To address this issue, this paper proposes a hierarchical control node selection algorithm based on triangular recursive compression and control influence index (HTRCI) to identify influential nodes and enhance network stability accurately. Firstly, the control influence index is introduced, integrating multiple attributes such as node energy level and neighbor variation rate to evaluate node importance comprehensively. Additionally, an efficient triangle detection algorithm based on intersection matrices is designed to improve the extraction efficiency of triangular features. To address the influence overlap caused by shared nodes and edges within triangular structures, this paper proposes a triangle control node selection method incorporating a conflict resolution mechanism. In non-triangular regions, this paper designs a non-triangular structure control node identification algorithm based on coverage maximization, which regulates the distribution of control nodes by introducing a repulsion mechanism. Furthermore, a hierarchical control node selection strategy is proposed to iteratively compress the management regions of control nodes, reducing the number of control nodes and improving the global control efficiency of the network. In NS3 simulations, the proposed algorithm is evaluated on six real-world networks and compared with eight state-of-the-art algorithms. The results demonstrate that the HTRCI algorithm exhibits significant advantages in terms of information transmission rate and network stability, validating its superiority and applicability in complex dynamic networks.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"317 ","pages":"Article 113434"},"PeriodicalIF":7.2000,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hierarchical influential node identification in multi-agent networks based on triangular recursive compression\",\"authors\":\"Yonggang Li ,&nbsp;Zhili Xiao ,&nbsp;Ang Gao ,&nbsp;Weinong Wu ,&nbsp;Errong Pei\",\"doi\":\"10.1016/j.knosys.2025.113434\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The identification of influential nodes in complex networks is a core research topic in the field of network science. Existing methods often rely on the topological features of static networks, which struggle to fully capture the characteristics of nodes in dynamic networks. To address this issue, this paper proposes a hierarchical control node selection algorithm based on triangular recursive compression and control influence index (HTRCI) to identify influential nodes and enhance network stability accurately. Firstly, the control influence index is introduced, integrating multiple attributes such as node energy level and neighbor variation rate to evaluate node importance comprehensively. Additionally, an efficient triangle detection algorithm based on intersection matrices is designed to improve the extraction efficiency of triangular features. To address the influence overlap caused by shared nodes and edges within triangular structures, this paper proposes a triangle control node selection method incorporating a conflict resolution mechanism. In non-triangular regions, this paper designs a non-triangular structure control node identification algorithm based on coverage maximization, which regulates the distribution of control nodes by introducing a repulsion mechanism. Furthermore, a hierarchical control node selection strategy is proposed to iteratively compress the management regions of control nodes, reducing the number of control nodes and improving the global control efficiency of the network. In NS3 simulations, the proposed algorithm is evaluated on six real-world networks and compared with eight state-of-the-art algorithms. The results demonstrate that the HTRCI algorithm exhibits significant advantages in terms of information transmission rate and network stability, validating its superiority and applicability in complex dynamic networks.</div></div>\",\"PeriodicalId\":49939,\"journal\":{\"name\":\"Knowledge-Based Systems\",\"volume\":\"317 \",\"pages\":\"Article 113434\"},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2025-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Knowledge-Based Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0950705125004812\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge-Based Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0950705125004812","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

复杂网络中影响节点的识别是网络科学领域的一个核心研究课题。现有的方法往往依赖于静态网络的拓扑特征,难以充分捕捉动态网络中节点的特征。针对这一问题,本文提出了一种基于三角递归压缩和控制影响指数(HTRCI)的分级控制节点选择算法,以准确识别影响节点,提高网络稳定性。首先,引入控制影响指标,综合节点能量等级、邻居变化率等多个属性对节点重要性进行综合评价;此外,为了提高三角形特征的提取效率,设计了一种基于交矩阵的高效三角形检测算法。为了解决三角形结构内部共享节点和共享边所造成的重叠影响,本文提出了一种结合冲突解决机制的三角形控制节点选择方法。在非三角形区域,设计了一种基于覆盖最大化的非三角形结构控制节点识别算法,该算法通过引入斥力机制来调节控制节点的分布。在此基础上,提出了分层控制节点选择策略,迭代压缩控制节点的管理区域,减少控制节点数量,提高网络的全局控制效率。在NS3仿真中,该算法在六个真实网络上进行了评估,并与八种最先进的算法进行了比较。结果表明,HTRCI算法在信息传输速率和网络稳定性方面具有显著优势,验证了其在复杂动态网络中的优越性和适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hierarchical influential node identification in multi-agent networks based on triangular recursive compression
The identification of influential nodes in complex networks is a core research topic in the field of network science. Existing methods often rely on the topological features of static networks, which struggle to fully capture the characteristics of nodes in dynamic networks. To address this issue, this paper proposes a hierarchical control node selection algorithm based on triangular recursive compression and control influence index (HTRCI) to identify influential nodes and enhance network stability accurately. Firstly, the control influence index is introduced, integrating multiple attributes such as node energy level and neighbor variation rate to evaluate node importance comprehensively. Additionally, an efficient triangle detection algorithm based on intersection matrices is designed to improve the extraction efficiency of triangular features. To address the influence overlap caused by shared nodes and edges within triangular structures, this paper proposes a triangle control node selection method incorporating a conflict resolution mechanism. In non-triangular regions, this paper designs a non-triangular structure control node identification algorithm based on coverage maximization, which regulates the distribution of control nodes by introducing a repulsion mechanism. Furthermore, a hierarchical control node selection strategy is proposed to iteratively compress the management regions of control nodes, reducing the number of control nodes and improving the global control efficiency of the network. In NS3 simulations, the proposed algorithm is evaluated on six real-world networks and compared with eight state-of-the-art algorithms. The results demonstrate that the HTRCI algorithm exhibits significant advantages in terms of information transmission rate and network stability, validating its superiority and applicability in complex dynamic networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Knowledge-Based Systems
Knowledge-Based Systems 工程技术-计算机:人工智能
CiteScore
14.80
自引率
12.50%
发文量
1245
审稿时长
7.8 months
期刊介绍: Knowledge-Based Systems, an international and interdisciplinary journal in artificial intelligence, publishes original, innovative, and creative research results in the field. It focuses on knowledge-based and other artificial intelligence techniques-based systems. The journal aims to support human prediction and decision-making through data science and computation techniques, provide a balanced coverage of theory and practical study, and encourage the development and implementation of knowledge-based intelligence models, methods, systems, and software tools. Applications in business, government, education, engineering, and healthcare are emphasized.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信