Time series forecasting using neural networks : are recurrent connections necessary?

Show simple item record

dc.contributor.author Abdulkarim, Salihu Aish
dc.contributor.author Engelbrecht, Andries P.
dc.date.accessioned 2019-07-18T07:03:44Z
dc.date.issued 2019-12
dc.description.abstract Artificial neural networks (NNs) are widely used in modeling and forecasting time series. Since most practical time series are non-stationary, NN forecasters are often implemented using recurrent/delayed connections to handle the temporal component of the time varying sequence. These recurrent/delayed connections increase the number of weights required to be optimized during training of the NN. Particle swarm optimization (PSO) is now an established method for training NNs, and was shown in several studies to outperform the classical backpropagation training algorithm. The original PSO was, however, designed for static environments. In dealing with non-stationary data, modified versions of PSOs for optimization in dynamic environments are used. These dynamic PSOs have been successfully used to train NNs on classification problems under non-stationary environments. This paper formulates training of a NN forecaster as dynamic optimization problem to investigate if recurrent/delayed connections are necessary in a NN time series forecaster when a dynamic PSO is used as the training algorithm. Experiments were carried out on eight forecasting problems. For each problem, a feedforward NN (FNN) is trained with a dynamic PSO algorithm and the performance is compared to that obtained from four different types of recurrent NNs (RNN) each trained using gradient descent, a standard PSO for static environments and the dynamic PSO algorithm. The RNNs employed were an Elman NN, a Jordan NN, a multirecurrent NN and a time delay NN. The performance of these forecasting models were evaluated under three different dynamic environmental scenarios. The results show that the FNNs trained with the dynamic PSO significantly outperformed all the RNNs trained using any of the other algorithms considered. These findings highlight that recurrent/delayed connections are not necessary in NNs used for time series forecasting (for the time series considered in this study) as long as a dynamic PSO algorithm is used as the training method. en_ZA
dc.description.department Computer Science en_ZA
dc.description.embargo 2020-06-12
dc.description.librarian hj2019 en_ZA
dc.description.uri https://link.springer.com/journal/11063 en_ZA
dc.identifier.citation Abdulkarim, S.A. & Engelbrecht, A.P. Time Series Forecasting Using Neural Networks: Are Recurrent Connections Necessary? Neural Processing Letters 50, 2763–2795 (2019) doi:10.1007/s11063-019-10061-5. en_ZA
dc.identifier.issn 1370-4621 (print)
dc.identifier.issn 1573-773X (online)
dc.identifier.other 10.1007/s11063-019-10061-5
dc.identifier.uri http://hdl.handle.net/2263/70762
dc.language.iso en en_ZA
dc.publisher Springer en_ZA
dc.rights © Springer Science+Business Media, LLC, part of Springer Nature 2019. The original publication is available at : https://link.springer.com/journal/11063. en_ZA
dc.subject Cooperative quantum particle swarm optimization en_ZA
dc.subject Particle swarm optimization (PSO) en_ZA
dc.subject Recurrent neural networks en_ZA
dc.subject Resilient propagation en_ZA
dc.subject Time series forecasting en_ZA
dc.subject Quantum particle swarm optimization en_ZA
dc.subject Non-stationary environment en_ZA
dc.subject Modeling and forecasting en_ZA
dc.subject Dynamic optimization problem (DOP) en_ZA
dc.subject Dynamic environments en_ZA
dc.subject Classical back-propagation en_ZA
dc.subject Time series en_ZA
dc.subject Forecasting en_ZA
dc.subject Backpropagation algorithms en_ZA
dc.subject Artificial neural network (ANN) en_ZA
dc.subject Neural network en_ZA
dc.title Time series forecasting using neural networks : are recurrent connections necessary? en_ZA
dc.type Postprint Article en_ZA


Files in this item

This item appears in the following Collection(s)

Show simple item record