基于学生数据集的改进进化算法分析

S. Ajibade, Muhammad Ayaz, Dai-Long Ngo-Hoang, Almighty C. Tabuena, F. Rabbi, Getahun Fikadu Tilaye, Mbiatke Anthony Bassey
{"title":"基于学生数据集的改进进化算法分析","authors":"S. Ajibade, Muhammad Ayaz, Dai-Long Ngo-Hoang, Almighty C. Tabuena, F. Rabbi, Getahun Fikadu Tilaye, Mbiatke Anthony Bassey","doi":"10.1109/i2cacis54679.2022.9815272","DOIUrl":null,"url":null,"abstract":"Evolutionary Algorithms (EAs) are powerful heuristic search approaches which relies on Darwinian evolution that capture global solutions to complex optimization problems which has powerful features of reliability and versatility. (EAs) such as Particle swarm optimization (PSO) is a global optimization method that is extremely effective. PSO's flaws include slow convergence, premature convergence, and getting stuck at local optima. In this paper, chaotic map and dynamic-weight Particle Swarm Optimization (CHDPSOA) are combined with PSO to enhance the search strategy through adjusting the inertia weight of PSO and changing the position update formula in the (CHDPSOA), resulting in efficient balancing for local and global PSO feature selection processes. The performance of CHDPSOA was compared to that of three metaheuristic techniques: Differential Evolution (DE) and the original PSO, using eight numerical functions. The validation of this technique is carried out on four different datasets. The results show that the CHDPSOA is a good feature selection technique that balances the exploration and exploitation search processes to produce good results. The proposed CHDPSOA method performed well in correctly categorizing features using the KNN Classifier for all four datasets.","PeriodicalId":332297,"journal":{"name":"2022 IEEE International Conference on Automatic Control and Intelligent Systems (I2CACIS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Analysis of Improved Evolutionary Algorithms Using Students’ Datasets\",\"authors\":\"S. Ajibade, Muhammad Ayaz, Dai-Long Ngo-Hoang, Almighty C. Tabuena, F. Rabbi, Getahun Fikadu Tilaye, Mbiatke Anthony Bassey\",\"doi\":\"10.1109/i2cacis54679.2022.9815272\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Evolutionary Algorithms (EAs) are powerful heuristic search approaches which relies on Darwinian evolution that capture global solutions to complex optimization problems which has powerful features of reliability and versatility. (EAs) such as Particle swarm optimization (PSO) is a global optimization method that is extremely effective. PSO's flaws include slow convergence, premature convergence, and getting stuck at local optima. In this paper, chaotic map and dynamic-weight Particle Swarm Optimization (CHDPSOA) are combined with PSO to enhance the search strategy through adjusting the inertia weight of PSO and changing the position update formula in the (CHDPSOA), resulting in efficient balancing for local and global PSO feature selection processes. The performance of CHDPSOA was compared to that of three metaheuristic techniques: Differential Evolution (DE) and the original PSO, using eight numerical functions. The validation of this technique is carried out on four different datasets. The results show that the CHDPSOA is a good feature selection technique that balances the exploration and exploitation search processes to produce good results. The proposed CHDPSOA method performed well in correctly categorizing features using the KNN Classifier for all four datasets.\",\"PeriodicalId\":332297,\"journal\":{\"name\":\"2022 IEEE International Conference on Automatic Control and Intelligent Systems (I2CACIS)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Conference on Automatic Control and Intelligent Systems (I2CACIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/i2cacis54679.2022.9815272\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Automatic Control and Intelligent Systems (I2CACIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/i2cacis54679.2022.9815272","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

进化算法(EAs)是一种强大的启发式搜索方法,它依赖于达尔文进化论,可以捕获复杂优化问题的全局解决方案,具有强大的可靠性和通用性。粒子群优化(PSO)是一种非常有效的全局优化方法。粒子群算法的缺陷包括收敛速度慢、过早收敛和陷入局部最优。本文将混沌映射和动态权值粒子群优化(CHDPSOA)与粒子群算法相结合,通过调整粒子群算法的惯性权值和改变粒子群算法中的位置更新公式,增强粒子群算法的搜索策略,实现局部和全局粒子群算法特征选择过程的有效平衡。使用8个数值函数,将CHDPSOA的性能与三种元启发式技术:差分进化(DE)和原始PSO的性能进行了比较。在四个不同的数据集上对该技术进行了验证。结果表明,CHDPSOA是一种很好的特征选择技术,它可以平衡探索和利用搜索过程,从而产生良好的结果。所提出的CHDPSOA方法在使用KNN分类器对所有四个数据集的特征进行正确分类方面表现良好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Analysis of Improved Evolutionary Algorithms Using Students’ Datasets
Evolutionary Algorithms (EAs) are powerful heuristic search approaches which relies on Darwinian evolution that capture global solutions to complex optimization problems which has powerful features of reliability and versatility. (EAs) such as Particle swarm optimization (PSO) is a global optimization method that is extremely effective. PSO's flaws include slow convergence, premature convergence, and getting stuck at local optima. In this paper, chaotic map and dynamic-weight Particle Swarm Optimization (CHDPSOA) are combined with PSO to enhance the search strategy through adjusting the inertia weight of PSO and changing the position update formula in the (CHDPSOA), resulting in efficient balancing for local and global PSO feature selection processes. The performance of CHDPSOA was compared to that of three metaheuristic techniques: Differential Evolution (DE) and the original PSO, using eight numerical functions. The validation of this technique is carried out on four different datasets. The results show that the CHDPSOA is a good feature selection technique that balances the exploration and exploitation search processes to produce good results. The proposed CHDPSOA method performed well in correctly categorizing features using the KNN Classifier for all four datasets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
IoT Bus Monitoring System via Mobile Application Amplitude Spectrum Design for Multivariable System Identification in Open Loop Study and Analysis of Various Crop Prediction Techniques in IoT Network: An Overview Background Subtraction for Accurate Palm Oil Fruitlet Ripeness Detection Real-time Face Mask Types Detection to Monitor Standard Operating Procedure Compliance Using You Only Look Once-based Framework
×
引用
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