使用修改后的向量加权平均值优化前馈神经网络:化学数据集案例研究

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Swarm and Evolutionary Computation Pub Date : 2024-07-13 DOI:10.1016/j.swevo.2024.101656
Essam H. Houssein , Mosa E. Hosney , Marwa M. Emam , Diego Oliva , Eman M.G. Younis , Abdelmgeid A. Ali , Waleed M. Mohamed
{"title":"使用修改后的向量加权平均值优化前馈神经网络:化学数据集案例研究","authors":"Essam H. Houssein ,&nbsp;Mosa E. Hosney ,&nbsp;Marwa M. Emam ,&nbsp;Diego Oliva ,&nbsp;Eman M.G. Younis ,&nbsp;Abdelmgeid A. Ali ,&nbsp;Waleed M. Mohamed","doi":"10.1016/j.swevo.2024.101656","DOIUrl":null,"url":null,"abstract":"<div><p>This paper proposes a modified version of the weighted mean of vectors algorithm (mINFO), which combines the strengths of the INFO algorithm with the Enhanced Solution Quality Operator (ESQ). The ESQ boosts the quality of the solutions by avoiding optimal local values, verifying that each solution moves towards a better position, and increasing the convergence speed. Furthermore, we employ the mINFO algorithm to optimize the connection weights and biases of feedforward neural networks (FNNs) to improve their accuracy. The efficacy of FNNs for classification tasks is mainly dependent on hyperparameter tuning, such as the number of layers and nodes. The mINFO was evaluated using the IEEE Congress on Evolutionary Computation held in 2020 (CEC’2020) for optimization tests, and ten chemical data sets were applied to validate the performance of the FNNs classifier. The proposed algorithm’s results have been evaluated with those of other well-known optimization methods, including Runge Kutta optimizer’s (RUN), particle swarm optimization (PSO), grey wolf optimization (GWO), Harris hawks optimization (HHO), whale optimization algorithm (WOA), slime mould algorithm (SMA) and the standard weighted mean of vectors (INFO). In addition, some improved metaheuristic algorithms. The experimental results indicate that the proposed mINFO algorithm can improve the convergence speed and generate effective search results without increasing computational costs. In addition, it has improved the FNN’s classification efficiency.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":8.2000,"publicationDate":"2024-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimizing feedforward neural networks using a modified weighted mean of vectors: Case study chemical datasets\",\"authors\":\"Essam H. Houssein ,&nbsp;Mosa E. Hosney ,&nbsp;Marwa M. Emam ,&nbsp;Diego Oliva ,&nbsp;Eman M.G. Younis ,&nbsp;Abdelmgeid A. Ali ,&nbsp;Waleed M. Mohamed\",\"doi\":\"10.1016/j.swevo.2024.101656\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper proposes a modified version of the weighted mean of vectors algorithm (mINFO), which combines the strengths of the INFO algorithm with the Enhanced Solution Quality Operator (ESQ). The ESQ boosts the quality of the solutions by avoiding optimal local values, verifying that each solution moves towards a better position, and increasing the convergence speed. Furthermore, we employ the mINFO algorithm to optimize the connection weights and biases of feedforward neural networks (FNNs) to improve their accuracy. The efficacy of FNNs for classification tasks is mainly dependent on hyperparameter tuning, such as the number of layers and nodes. The mINFO was evaluated using the IEEE Congress on Evolutionary Computation held in 2020 (CEC’2020) for optimization tests, and ten chemical data sets were applied to validate the performance of the FNNs classifier. The proposed algorithm’s results have been evaluated with those of other well-known optimization methods, including Runge Kutta optimizer’s (RUN), particle swarm optimization (PSO), grey wolf optimization (GWO), Harris hawks optimization (HHO), whale optimization algorithm (WOA), slime mould algorithm (SMA) and the standard weighted mean of vectors (INFO). In addition, some improved metaheuristic algorithms. The experimental results indicate that the proposed mINFO algorithm can improve the convergence speed and generate effective search results without increasing computational costs. In addition, it has improved the FNN’s classification efficiency.</p></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2024-07-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Swarm and Evolutionary Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210650224001949\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650224001949","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种改进版的向量加权平均算法(mINFO),它结合了 INFO 算法和增强解质量运算符(ESQ)的优点。ESQ 通过避免最优局部值、验证每个解决方案是否向更好的位置移动以及提高收敛速度来提高解决方案的质量。此外,我们还采用 mINFO 算法来优化前馈神经网络(FNN)的连接权重和偏置,以提高其准确性。前馈神经网络在分类任务中的功效主要取决于超参数的调整,如层数和节点数。利用 2020 年举行的 IEEE 进化计算大会(CEC'2020)对 mINFO 进行了优化测试评估,并应用十个化学数据集来验证 FNN 分类器的性能。所提出算法的结果与其他著名优化方法的结果进行了评估,包括 Runge Kutta 优化器(RUN)、粒子群优化(PSO)、灰狼优化(GWO)、哈里斯鹰优化(HHO)、鲸鱼优化算法(WOA)、粘菌算法(SMA)和向量标准加权平均值(INFO)。此外,还有一些改进的元启发式算法。实验结果表明,所提出的 mINFO 算法可以在不增加计算成本的情况下提高收敛速度,并生成有效的搜索结果。此外,它还提高了 FNN 的分类效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimizing feedforward neural networks using a modified weighted mean of vectors: Case study chemical datasets

This paper proposes a modified version of the weighted mean of vectors algorithm (mINFO), which combines the strengths of the INFO algorithm with the Enhanced Solution Quality Operator (ESQ). The ESQ boosts the quality of the solutions by avoiding optimal local values, verifying that each solution moves towards a better position, and increasing the convergence speed. Furthermore, we employ the mINFO algorithm to optimize the connection weights and biases of feedforward neural networks (FNNs) to improve their accuracy. The efficacy of FNNs for classification tasks is mainly dependent on hyperparameter tuning, such as the number of layers and nodes. The mINFO was evaluated using the IEEE Congress on Evolutionary Computation held in 2020 (CEC’2020) for optimization tests, and ten chemical data sets were applied to validate the performance of the FNNs classifier. The proposed algorithm’s results have been evaluated with those of other well-known optimization methods, including Runge Kutta optimizer’s (RUN), particle swarm optimization (PSO), grey wolf optimization (GWO), Harris hawks optimization (HHO), whale optimization algorithm (WOA), slime mould algorithm (SMA) and the standard weighted mean of vectors (INFO). In addition, some improved metaheuristic algorithms. The experimental results indicate that the proposed mINFO algorithm can improve the convergence speed and generate effective search results without increasing computational costs. In addition, it has improved the FNN’s classification efficiency.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
期刊最新文献
A cloud 15kV-HDPE insulator leakage current classification based improved particle swarm optimization and LSTM-CNN deep learning approach A multi-strategy optimizer for energy minimization of multi-UAV-assisted mobile edge computing An archive-assisted multi-modal multi-objective evolutionary algorithm Historical knowledge transfer driven self-adaptive evolutionary multitasking algorithm with hybrid resource release for solving nonlinear equation systems Expected coordinate improvement for high-dimensional Bayesian optimization
×
引用
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