Abstract
An evolved recurrent neural network is proposed which automates the design of the network architecture and the connection weights using a new evolutionary learning algorithm. This new algorithm is based on a cooperative system of evolutionary algorithm (EA) and particle swarm optimisation (PSO), and is thus called REAPSO. In REAPSO, the network architecture is adaptively adjusted by PSO, and then EA is employed to evolve the connection weights with this network architecture, and this process is alternated until the best neural network is accepted or the maximum number of generations has been reached. In addition, the strategy of EAC and ET are proposed to maintain the behavioral link between a parent and its offspring, which improves the efficiency of evolving recurrent neural networks. A recurrent neural network is evolved by REAPSO and applied to the state estimation of the CSTR System. The performance of REAPSO is compared to TDRB, GA, PSO and HGAPSO in these recurrent networks design problems, demonstrating its superiority.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pineda, F.J.: Generalization of backpropagation to recurrent neural networks. Physical Review Letters 59(19), 2229–2232 (1987)
Rumelhart, D.E., Hinton, G.E., Williams, R.J.: Learning internal representations by error propagation. Parallel Distributed Processing 1, 318–362 (1986)
Williams, R.J., Zipser, D.: A learning algorithm for continually running recurrent neural networks. Neural Comput. 1(2), 270–280 (1989)
Pearlmutter, B.A.: Learning state space trajectories in recurrent neural networks. Neural Comput. 1, 263–269 (1989)
Lei, J., He, G., Jiang, J.P.: The State Estimation of the CSTR System Based on a Recurrent Neural Network Trained by HGAs. In: International Conference on Neural Networks, vol. 2, pp. 779–782 (1997)
Heimes, F., Zalesski, G., Oshima, M.: Traditional and evolved dynamic neural networks for aircraft simulation. In: Proc. IEEE Int. Conf. Systems, Man, and Cybernetics, Part 3 (of 5), pp. 1995–2000 (1997)
Whitley, D.: Genetic algorithms and neural networks. In: Winter, G., Periaux, J., Galan, M., Cuesta, P. (eds.) Genetic Algorithms Engineering and Computer Science, pp. 191–201. Wiley, New York (1995)
Jaszkiewicz: Comparison of local search-based metaheuristics on the multiple-objective knapsack problem. Found. Comput. Decision Sci. 26, 99–120 (2001)
Juang, C.-F.: A hybrid of genetic algorithm and particle swarm optimization for recurrent network design. IEEE Transactions on Systems, Man, and Cubernetics - Part B: Cybernetics 34(2), 997–1006 (2004)
Cai, X., Zhang, N., Venayagamoorthy, G., Wunsch, D.: Time Series Prediction with Recurrent Neural Networks Using a Hybrid PSO-EA Algorithm. In: IJCNN 2004, Budapest (2004)
Burgess, N.: A constructive algorithm that converges for real-valued input patterns. Int. J. Neural Syst. 5(1), 59–66 (1994)
Reed, R.: Pruning algorithms-A survey. IEEE trans. Neural Networks 4, 740–747 (1995)
Angeline, P.J., Sauders, G.M., Pollack, J.B.: An evolutionary algorithm that constructs recurrent neural networks. IEEE Trans. Neural Networks 5, 54–65 (1994)
Yao, X.: A review of evolutionary artificial neural networks. Int. J. Intell. Syst. 8(4), 539–567 (1993)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. IEEE International Conference on Neural Networks, pp. 39–43. IEEE Service Center, Piscataway (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, C., Hu, H. (2005). An Evolved Recurrent Neural Network and Its Application. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539087_11
Download citation
DOI: https://doi.org/10.1007/11539087_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28323-2
Online ISBN: 978-3-540-31853-8
eBook Packages: Computer ScienceComputer Science (R0)