IMATSA - 基于调谐群算法的改进型自适应智能优化算法

IF 1.4 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Yan Chen, Weizhen Dong, Xiaochun Hu
{"title":"IMATSA - 基于调谐群算法的改进型自适应智能优化算法","authors":"Yan Chen, Weizhen Dong, Xiaochun Hu","doi":"10.3233/aic-220093","DOIUrl":null,"url":null,"abstract":"Swarm intelligence optimization algorithm has been proved to perform well in the field of parameter optimization. In order to further improve the performance of intelligent optimization algorithm, this paper proposes an improved and adaptive tunicate swarm algorithm (IMATSA) based on tunicate swarmalgorithm (TSA). IMATSA improves TSA in the following four aspects: population diversity, local search convergence speed, jumping out of local optimal position, and balancing global and local search. Firstly, IMATSA adopts Tent map and quadratic interpolation to initialize population and enhance the diversity. Secondly, IMATSA uses Golden-Sine algorithm to accelerate the convergence of local search. Thirdly, in the process of global development, IMATSA adopts Levy flight and the improved Gauss disturbance method to adaptively improves and coordinates the ability of global development and local search. Then, this paper verifies the performance of IMATSA based on 14 benchmark functions experiment, ablation experiment, parameter optimization experiments of Support Vector Machine (SVM) and Gradient Boosting Decision Tree (GBDT), Wilcoxon signed rank test and image multi-threshold segmentation experiment with the performance metrics are convergence speed, convergence value, significance level P-value, Peak Signal-to-Noise Ratio (PSNR) and Standard Deviation (STD). Experimental results show that IMATSA performs better in three kinds of benchmark functions; each component of IMATSA has a positive effect on the performance; IMATSA performs better in parameter optimization experiments of SVM experiment and GBDT; there is significant difference between IMATSA and other algorithms by Wilcoxon signed rank test; in image segmentation, the performance is directly proportional to the number of thresholds, and compared with other algorithms, IMATSA has better comprehensive performance.","PeriodicalId":50835,"journal":{"name":"AI Communications","volume":"131 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"IMATSA – an improved and adaptive intelligent optimization algorithm based on tunicate swarm algorithm\",\"authors\":\"Yan Chen, Weizhen Dong, Xiaochun Hu\",\"doi\":\"10.3233/aic-220093\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Swarm intelligence optimization algorithm has been proved to perform well in the field of parameter optimization. In order to further improve the performance of intelligent optimization algorithm, this paper proposes an improved and adaptive tunicate swarm algorithm (IMATSA) based on tunicate swarmalgorithm (TSA). IMATSA improves TSA in the following four aspects: population diversity, local search convergence speed, jumping out of local optimal position, and balancing global and local search. Firstly, IMATSA adopts Tent map and quadratic interpolation to initialize population and enhance the diversity. Secondly, IMATSA uses Golden-Sine algorithm to accelerate the convergence of local search. Thirdly, in the process of global development, IMATSA adopts Levy flight and the improved Gauss disturbance method to adaptively improves and coordinates the ability of global development and local search. Then, this paper verifies the performance of IMATSA based on 14 benchmark functions experiment, ablation experiment, parameter optimization experiments of Support Vector Machine (SVM) and Gradient Boosting Decision Tree (GBDT), Wilcoxon signed rank test and image multi-threshold segmentation experiment with the performance metrics are convergence speed, convergence value, significance level P-value, Peak Signal-to-Noise Ratio (PSNR) and Standard Deviation (STD). Experimental results show that IMATSA performs better in three kinds of benchmark functions; each component of IMATSA has a positive effect on the performance; IMATSA performs better in parameter optimization experiments of SVM experiment and GBDT; there is significant difference between IMATSA and other algorithms by Wilcoxon signed rank test; in image segmentation, the performance is directly proportional to the number of thresholds, and compared with other algorithms, IMATSA has better comprehensive performance.\",\"PeriodicalId\":50835,\"journal\":{\"name\":\"AI Communications\",\"volume\":\"131 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-03-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AI Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.3233/aic-220093\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AI Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3233/aic-220093","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

事实证明,群智能优化算法在参数优化领域具有良好的性能。为了进一步提高智能优化算法的性能,本文在调谐蜂群算法(TSA)的基础上提出了一种改进的自适应调谐蜂群算法(IMATSA)。IMATSA 从种群多样性、局部搜索收敛速度、跳出局部最优位置、平衡全局搜索和局部搜索四个方面对 TSA 进行了改进。首先,IMATSA 采用 Tent map 和二次插值来初始化种群,提高了种群多样性。其次,IMATSA 采用 Golden-Sine 算法加快局部搜索的收敛速度。第三,在全局发展过程中,IMATSA 采用 Levy flight 和改进的高斯干扰法,自适应地提高和协调全局发展和局部搜索的能力。然后,本文基于14个基准函数实验、消融实验、支持向量机(SVM)和梯度提升决策树(GBDT)参数优化实验、Wilcoxon符号秩检验和图像多阈值分割实验验证了IMATSA的性能,性能指标包括收敛速度、收敛值、显著性水平P值、峰值信噪比(PSNR)和标准偏差(STD)。实验结果表明:IMATSA 在三种基准函数中表现较好;IMATSA 的每个组成部分都对性能有积极影响;IMATSA 在 SVM 实验和 GBDT 的参数优化实验中表现较好;通过 Wilcoxon 符号秩检验,IMATSA 与其他算法有显著差异;在图像分割中,性能与阈值数成正比,与其他算法相比,IMATSA 具有更好的综合性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
IMATSA – an improved and adaptive intelligent optimization algorithm based on tunicate swarm algorithm
Swarm intelligence optimization algorithm has been proved to perform well in the field of parameter optimization. In order to further improve the performance of intelligent optimization algorithm, this paper proposes an improved and adaptive tunicate swarm algorithm (IMATSA) based on tunicate swarmalgorithm (TSA). IMATSA improves TSA in the following four aspects: population diversity, local search convergence speed, jumping out of local optimal position, and balancing global and local search. Firstly, IMATSA adopts Tent map and quadratic interpolation to initialize population and enhance the diversity. Secondly, IMATSA uses Golden-Sine algorithm to accelerate the convergence of local search. Thirdly, in the process of global development, IMATSA adopts Levy flight and the improved Gauss disturbance method to adaptively improves and coordinates the ability of global development and local search. Then, this paper verifies the performance of IMATSA based on 14 benchmark functions experiment, ablation experiment, parameter optimization experiments of Support Vector Machine (SVM) and Gradient Boosting Decision Tree (GBDT), Wilcoxon signed rank test and image multi-threshold segmentation experiment with the performance metrics are convergence speed, convergence value, significance level P-value, Peak Signal-to-Noise Ratio (PSNR) and Standard Deviation (STD). Experimental results show that IMATSA performs better in three kinds of benchmark functions; each component of IMATSA has a positive effect on the performance; IMATSA performs better in parameter optimization experiments of SVM experiment and GBDT; there is significant difference between IMATSA and other algorithms by Wilcoxon signed rank test; in image segmentation, the performance is directly proportional to the number of thresholds, and compared with other algorithms, IMATSA has better comprehensive performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
AI Communications
AI Communications 工程技术-计算机:人工智能
CiteScore
2.30
自引率
12.50%
发文量
34
审稿时长
4.5 months
期刊介绍: AI Communications is a journal on artificial intelligence (AI) which has a close relationship to EurAI (European Association for Artificial Intelligence, formerly ECCAI). It covers the whole AI community: Scientific institutions as well as commercial and industrial companies. AI Communications aims to enhance contacts and information exchange between AI researchers and developers, and to provide supranational information to those concerned with AI and advanced information processing. AI Communications publishes refereed articles concerning scientific and technical AI procedures, provided they are of sufficient interest to a large readership of both scientific and practical background. In addition it contains high-level background material, both at the technical level as well as the level of opinions, policies and news.
×
引用
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学术官方微信