一种提高复杂网络鲁棒性的遗传算法

C. Pizzuti, Annalisa Socievole
{"title":"一种提高复杂网络鲁棒性的遗传算法","authors":"C. Pizzuti, Annalisa Socievole","doi":"10.1109/ICTAI.2018.00085","DOIUrl":null,"url":null,"abstract":"A method to enhance the robustness of a network, based on Genetic Algorithms, is proposed. The approach optimizes the effective graph resistance of a network, a measure of robustness derived from the field of electric circuit analysis, that can be computed as a cumulative sum of the eigenvalues of the Laplacian matrix associated with the network. Specialized variation operators allow the method to find a solution almost always coinciding with that obtained by the exhaustive search. Experiments on synthetic and real life networks show that the approach outperforms heuristic strategies extensively investigated, by giving the exact solution in a high percentage of the considered networks.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"128 7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Genetic Algorithm for Improving Robustness of Complex Networks\",\"authors\":\"C. Pizzuti, Annalisa Socievole\",\"doi\":\"10.1109/ICTAI.2018.00085\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method to enhance the robustness of a network, based on Genetic Algorithms, is proposed. The approach optimizes the effective graph resistance of a network, a measure of robustness derived from the field of electric circuit analysis, that can be computed as a cumulative sum of the eigenvalues of the Laplacian matrix associated with the network. Specialized variation operators allow the method to find a solution almost always coinciding with that obtained by the exhaustive search. Experiments on synthetic and real life networks show that the approach outperforms heuristic strategies extensively investigated, by giving the exact solution in a high percentage of the considered networks.\",\"PeriodicalId\":254686,\"journal\":{\"name\":\"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)\",\"volume\":\"128 7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTAI.2018.00085\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2018.00085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了一种基于遗传算法增强网络鲁棒性的方法。该方法优化了网络的有效图电阻,这是一种来自电路分析领域的鲁棒性度量,可以通过与网络相关的拉普拉斯矩阵的特征值的累积和来计算。专门的变分算子使该方法几乎总是能找到与穷举搜索得到的解一致的解。在合成网络和现实生活网络上的实验表明,该方法优于广泛研究的启发式策略,在考虑的网络中给出了高百分比的精确解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Genetic Algorithm for Improving Robustness of Complex Networks
A method to enhance the robustness of a network, based on Genetic Algorithms, is proposed. The approach optimizes the effective graph resistance of a network, a measure of robustness derived from the field of electric circuit analysis, that can be computed as a cumulative sum of the eigenvalues of the Laplacian matrix associated with the network. Specialized variation operators allow the method to find a solution almost always coinciding with that obtained by the exhaustive search. Experiments on synthetic and real life networks show that the approach outperforms heuristic strategies extensively investigated, by giving the exact solution in a high percentage of the considered networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
[Title page i] Enhanced Unsatisfiable Cores for QBF: Weakening Universal to Existential Quantifiers Effective Ant Colony Optimization Solution for the Brazilian Family Health Team Scheduling Problem Exploiting Global Semantic Similarity Biterms for Short-Text Topic Discovery Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1