KaydedilenlerDerginizi ekleyin

Dergiler / Turkish Journal of Electrical Engineering and Computer Science / 2012 / Cilt: 20 - Sayı: 4

Simulated annealing algorithm-based Elman network for dynamic system identification

Adem KALINLI
Sayfa
569–582
Yayın Tarihi
2012-04-01
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

The SA algorithm is an efficient random search procedure, which can simultaneously obtain the optimal weight values of both the feedforward and feedback connections.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:One of the well-known recurrent neural networks is the Elman network.
📊
Temel Bulgular & Veri:Recently, it has been used in applications of system identification.
💡
Sonuç & Katkı:The SA algorithm is an efficient random search procedure, which can simultaneously obtain the optimal weight values of both the feedforward and feedback connections.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Elman network · simulated annealing · tabu search

Özet

One of the well-known recurrent neural networks is the Elman network. Recently, it has been used in applications of system identification. The network has feedforward and feedback connections. It can be trained essentially as a feedforward network by means of the basic backpropagation algorithm, but its feedback connections have to be kept constant. For training success, it is important to select the correct values for the feedback connections. However, finding these values manually can be a lengthy trial-and-error process. This paper investigates the use of the simulated annealing (SA) algorithm to obtain the weight values of both the feedforward and feedback connections of Elman networks used for dynamic system identification. The SA algorithm is an efficient random search procedure, which can simultaneously obtain the optimal weight values of both the feedforward and feedback connections.

Abstract

One of the well-known recurrent neural networks is the Elman network. Recently, it has been used in applications of system identification. The network has feedforward and feedback connections. It can be trained essentially as a feedforward network by means of the basic backpropagation algorithm, but its feedback connections have to be kept constant. For training success, it is important to select the correct values for the feedback connections. However, finding these values manually can be a lengthy trial-and-error process. This paper investigates the use of the simulated annealing (SA) algorithm to obtain the weight values of both the feedforward and feedback connections of Elman networks used for dynamic system identification. The SA algorithm is an efficient random search procedure, which can simultaneously obtain the optimal weight values of both the feedforward and feedback connections.

🔖

Bu Makaleye Atıf Yap

KALINLI, A. (2012). Simulated annealing algorithm-based Elman network for dynamic system identification. Turkish Journal of Electrical Engineering and Computer Science, Cilt: 20 - Sayı: 4, 569–582. https://ajindex.com/articles/188648

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (15)

  1. D.T. Pham, D. Karaboga, Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks, London, Springer-Verlag, 2000.
  2. D.T. Pham, S.J. Oh, “A recurrent backpropagation neural network for dynamic system identiŞcation”, Journal of Systems Engineering, Vol. 2, pp. 213-223, 1992.
  3. X. Liu, Modelling and Prediction Using Neural Networks, PhD Thesis, University of Wales College of Cardiff, Cardiff, UK, 1993.
  4. D.T. Pham, X. Liu, “IdentiŞcation of linear and nonlinear dynamic systems using recurrent neural networks”, ArtiŞcial Intelligence in Engineering, Vol. 8, pp. 67-75, 1993.
  5. A. Kalinli, S. Sagiroglu, “Elman network with embedded memory for system identiŞcation”, Journal of Information Science and Engineering, Vol. 22, pp. 1555-1568, 1996.
  6. D. Karaboga, A. Kalinli, “Training recurrent neural networks using tabu search algorithm”, 5th Turkish Symposium on ArtiŞcial Intelligence and Neural Networks, pp. 293-298, 1996.
  7. D.T. Pham, X. Liu, Neural Networks for IdentiŞcation, Prediction and Control, 4th ed., London, Springer-Verlag, 1999.
  8. D.T. Pham, D. Karaboga, “Training Elman and Jordan networks for system identiŞcation using genetic algorithms”, ArtiŞcial Intelligence in Engineering, Vol. 13, pp. 107-117, 1999.
  9. A. Thammano, P. Ruxpakawong, “Nonlinear dynamic system identiŞcation using recurrent neural network with multi-segment piecewise-linear connection weight”, Memetic Computing, Vol. 2, pp. 273-282, 2010.
  10. R.S. Sexton, J.N.D. Gupta, “Comparative evaluation of genetic algorithm and backpropagation for training neural networks”, Information Sciences, Vol. 129, pp. 45-59, 2000.
  11. P.A. Castillo, J.J. Merelo, A. Prieto, V. Rivas, G. Romero, “G-Prop: Global optimization of multilayer perceptrons using GAs”, Neurocomputing, Vol. 35, pp. 149-163, 2000.
  12. J Arifovic, R. Gen¸cay, “Using genetic algorithms to select architecture of a feedforward artiŞcial neural network”, Physica A, Vol. 289, pp. 574-594, 2001.
  13. K.W. Ku, M.W. Mak, W.C. Siu, “Adding learning to cellular genetic algorithms for training recurrent neural networks”, IEEE Transactions on Neural Networks, Vol. 10, pp. 239-252, 1999.
  14. A. Blanco, M. Delgado, M.C. Pegalajar, “A genetic algorithm to obtain the optimal recurrent neural network”, International Journal of Approximate Reasoning, Vol. 23, pp. 67-83, 2000.
  15. A. Blanco, M. Delgado, M.C. Pegalajar, “A real-coded genetic algorithm for training recurrent neural networks”, Neural Networks, Vol. 14, pp. 93-105, 2001. R. Battiti,