Time series prediction with recurrent neural networks trained by a hybrid PSO-EA algorithm

被引:91
作者
Cai, Xindi [1 ]
Zhang, Nian
Venayagamoorthy, Ganesh K.
Wunsch, Donald C., II
机构
[1] Univ Missouri, Dept Elect & Comp Engn, Appl Computat Intelligence Lab, Rolla, MO 65409 USA
[2] S Dakota Sch Mines & Technol, Dept Elect & Comp Engn, Rapid City, SD USA
[3] Univ Missouri, Dept Elect & Comp Engn, Real Time Power & Intelligence Syst Lab, Rolla, MO 65409 USA
基金
美国国家科学基金会;
关键词
particle swarm optimization; evolutionary algorithm; recurrent neural networks; time series prediction;
D O I
10.1016/j.neucom.2005.12.138
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
To predict the 100 missing values from a time series of 5000 data points, given for the IJCNN 2004 time series prediction competition, recurrent neural networks (RNNs) are trained with a new learning algorithm. This training algorithm is based on a hybrid of particle swarm optimization (PSO) and evolutionary algorithm (EA). By combining the searching abilities of these two global optimization methods, the evolution of individuals is no longer restricted to be in the same generation, and better performing individuals may produce offspring to replace those with poor performance. Experimental results show that RNNs, trained by the hybrid algorithm, are able to predict the missing values in the time series with minimum error, in comparison with those trained with standard EA and PSO algorithms. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:2342 / 2353
页数:12
相关论文
共 28 条
  • [1] Using selection to improve particle swarm optimization
    Angeline, PJ
    [J]. 1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, : 84 - 89
  • [2] BLACKWELL T, 2002, P 2002 C EV COMP, V2, P1691
  • [3] Blackwell Tim., 2007, Particle swarm optimization, encyclopedia of machine learning, V1, P33, DOI DOI 10.4018/IJMFMP.2015010104
  • [4] Cai XD, 2004, IEEE IJCNN, P1647
  • [5] Evolution, neural networks, games, and intelligence
    Chellapilla, K
    Fogel, DB
    [J]. PROCEEDINGS OF THE IEEE, 1999, 87 (09) : 1471 - 1496
  • [6] Optimal PSO for collective robotic search applications
    Doctor, S
    Venayagamoorthy, GK
    Gudise, VG
    [J]. CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, : 1390 - 1395
  • [7] Durbin R., 1998, Biological sequence analysis: Probabilistic models of proteins and nucleic acids
  • [8] Eberhart RC, 2001, IEEE C EVOL COMPUTAT, P81, DOI 10.1109/CEC.2001.934374
  • [9] Eberhart RC., 2001, SWARM INTELL-US
  • [10] FINDING STRUCTURE IN TIME
    ELMAN, JL
    [J]. COGNITIVE SCIENCE, 1990, 14 (02) : 179 - 211