{"title":"基于aco的神经网络提高时间网络的网络可控性效率","authors":"Jie Zhang, Ling Ding, 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, Ling Ding, 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}
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 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.