A new genetic algorithm method based on statistical-based replacement for the training of multiplicative neuron model artificial neural networks

Author:

Egrioglu ErolORCID,Grosan CrinaORCID,Bas ErenORCID

Abstract

AbstractIn this study, we propose a new genetic algorithm that uses a statistical-based chromosome replacement strategy determined by the empirical distribution of the objective function values. The proposed genetic algorithm is further used in the training process of a multiplicative neuron model artificial neural network. The objective function value for the genetic algorithm is the root mean square error of the multiplicative neuron model artificial neural network prediction. This combination of methods is proposed for a particular type of problems, that is, time-series prediction. We use different subsets of three stock exchange time series to test the performance of the proposed method and compare it against similar approaches, and the results prove that the proposed genetic algorithm for the multiplicative neuron model of the artificial neural network works better than many other artificial intelligence optimization methods. The ranks of the proposed method are 1.78 for the Nikkei data sets, 1.55 for the S&P500 data sets and 1.22 for the DOW JONES data sets for data corresponding to different years, according to the root mean square error, respectively. Moreover, the overall mean rank is 1.50 for the proposed method. Also, the proposed method obtains the best performance overall as well as the best performance for all the individual tests. The results certify that our method is robust and efficient for the task investigated.

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Information Systems,Theoretical Computer Science,Software

Reference39 articles.

1. Delgoshaei A, Aram A, Mantegh V, Hanjani S, Nasiri AH, Shirmohamadi F (2019) A multi-objectives weighting genetic algorithm for scheduling resource-constraint project problem in the presence of resource uncertainty. Int J Supply Op Manag 6(3):213–230

2. Delgoshaei A, Ariffin M, Baharudin BHTB, Leman Z (2015) minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithm. Int J Ind Eng Comput 6(4):503–520

3. Jones AJ (1993) Genetic algorithms and their applications to the design of neural networks. Neural Comput Appl 1(1):32–45

4. Yildirim AN, Bas E, Egrioglu E (2021) Threshold single multiplicative neuron artificial neural networks for non-linear time series forecasting. J Appl Stat 48(13–15):2809–2825

5. Back B, Laitinen T, Sere K (1996) Neural networks and genetic algorithms for bankruptcy predictions. Expert Syst Appl 11(4):407–413

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3