基于aco的神经网络提高时间网络的网络可控性效率

IF 1.7 4区 工程技术 Q2 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Complexity Pub Date : 2025-07-24 DOI:10.1155/cplx/5780747
Jie Zhang, Ling Ding, Peyman Arebi
{"title":"基于aco的神经网络提高时间网络的网络可控性效率","authors":"Jie Zhang,&nbsp;Ling Ding,&nbsp;Peyman Arebi","doi":"10.1155/cplx/5780747","DOIUrl":null,"url":null,"abstract":"<div>\n <p>The controllability of temporal networks has been one of the most important challenges in this type of network over the last decade. The main goal of network controllability processes is to find the minimum set of control nodes in such a way that all network nodes can be controlled by them. This problem is NP-hard in the temporal networks. In this paper, a controllability method is proposed to improve the efficiency of the controllability process on temporal networks. In the proposed method, a population method based on the ant colony optimization (ACO) algorithm is proposed, which is compatible with temporal networks. Due to the temporal nature of the controllability processes in temporal networks, the ACO algorithm is adapted temporally. Also, due to the time-consuming controllable processes in temporal networks and in order to increase the efficiency of the ACO algorithm, a backpropagation neural network has been used, which finds the minimum driver node set of the network based on the layered model in order to fully control the network nodes. The results of the implementation of the proposed method on real-world datasets demonstrate that the proposed ACO-BPNN method works stably and with high efficiency on high-volume datasets. By comparing the efficiency of the proposed method with conventional controllability methods, it is found that the proposed method has performed better in terms of the speed of execution and the length of the minimum driver node set.</p>\n </div>","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2025 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/cplx/5780747","citationCount":"0","resultStr":"{\"title\":\"ACO-Based Neural Network to Enhance the Efficiency of Network Controllability of Temporal Networks\",\"authors\":\"Jie Zhang,&nbsp;Ling Ding,&nbsp;Peyman Arebi\",\"doi\":\"10.1155/cplx/5780747\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n <p>The controllability of temporal networks has been one of the most important challenges in this type of network over the last decade. The main goal of network controllability processes is to find the minimum set of control nodes in such a way that all network nodes can be controlled by them. This problem is NP-hard in the temporal networks. In this paper, a controllability method is proposed to improve the efficiency of the controllability process on temporal networks. In the proposed method, a population method based on the ant colony optimization (ACO) algorithm is proposed, which is compatible with temporal networks. Due to the temporal nature of the controllability processes in temporal networks, the ACO algorithm is adapted temporally. Also, due to the time-consuming controllable processes in temporal networks and in order to increase the efficiency of the ACO algorithm, a backpropagation neural network has been used, which finds the minimum driver node set of the network based on the layered model in order to fully control the network nodes. The results of the implementation of the proposed method on real-world datasets demonstrate that the proposed ACO-BPNN method works stably and with high efficiency on high-volume datasets. By comparing the efficiency of the proposed method with conventional controllability methods, it is found that the proposed method has performed better in terms of the speed of execution and the length of the minimum driver node set.</p>\\n </div>\",\"PeriodicalId\":50653,\"journal\":{\"name\":\"Complexity\",\"volume\":\"2025 1\",\"pages\":\"\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2025-07-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1155/cplx/5780747\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Complexity\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1155/cplx/5780747\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/cplx/5780747","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

在过去的十年中,时间网络的可控性一直是这类网络最重要的挑战之一。网络可控性过程的主要目标是找到最小的控制节点集,使所有网络节点都能被其控制。这个问题在时间网络中是np困难的。本文提出了一种可控性方法,以提高时间网络可控性过程的效率。在该方法中,提出了一种基于蚁群优化(ACO)算法的种群方法,该方法与时间网络兼容。由于时间网络中可控性过程的时代性,蚁群算法具有时代性。同时,为了提高蚁群算法的效率和控制过程耗时,采用了基于分层模型的反向传播神经网络,寻找网络的最小驱动节点集,实现对网络节点的完全控制。在实际数据集上的实现结果表明,所提出的ACO-BPNN方法在大容量数据集上工作稳定,效率高。通过与传统可控性方法的效率比较,发现该方法在执行速度和最小驱动节点集长度方面都有更好的表现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

ACO-Based Neural Network to Enhance the Efficiency of Network Controllability of Temporal Networks

ACO-Based Neural Network to Enhance the Efficiency of Network Controllability of Temporal Networks

The controllability of temporal networks has been one of the most important challenges in this type of network over the last decade. The main goal of network controllability processes is to find the minimum set of control nodes in such a way that all network nodes can be controlled by them. This problem is NP-hard in the temporal networks. In this paper, a controllability method is proposed to improve the efficiency of the controllability process on temporal networks. In the proposed method, a population method based on the ant colony optimization (ACO) algorithm is proposed, which is compatible with temporal networks. Due to the temporal nature of the controllability processes in temporal networks, the ACO algorithm is adapted temporally. Also, due to the time-consuming controllable processes in temporal networks and in order to increase the efficiency of the ACO algorithm, a backpropagation neural network has been used, which finds the minimum driver node set of the network based on the layered model in order to fully control the network nodes. The results of the implementation of the proposed method on real-world datasets demonstrate that the proposed ACO-BPNN method works stably and with high efficiency on high-volume datasets. By comparing the efficiency of the proposed method with conventional controllability methods, it is found that the proposed method has performed better in terms of the speed of execution and the length of the minimum driver node set.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Complexity
Complexity 综合性期刊-数学跨学科应用
CiteScore
5.80
自引率
4.30%
发文量
595
审稿时长
>12 weeks
期刊介绍: Complexity is a cross-disciplinary journal focusing on the rapidly expanding science of complex adaptive systems. The purpose of the journal is to advance the science of complexity. Articles may deal with such methodological themes as chaos, genetic algorithms, cellular automata, neural networks, and evolutionary game theory. Papers treating applications in any area of natural science or human endeavor are welcome, and especially encouraged are papers integrating conceptual themes and applications that cross traditional disciplinary boundaries. Complexity is not meant to serve as a forum for speculation and vague analogies between words like “chaos,” “self-organization,” and “emergence” that are often used in completely different ways in science and in daily life.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信