Augmentation of Elman Recurrent Network learning with particle swarm optimization
Despite a variety of Artificial Neural Network (ANN) categories, Backpropagation Network (BP) and Elman Recurrent Network (ERN) are the widespread modus operandi in real applications. However, there are many drawbacks in BP network, for instance, confinement in finding local minimum and may get stuc...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book Section |
| Published: |
IEEE
2008
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/12505/ http://dx.doi.org/10.1109/AMS.2008.50 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Malaysia |
| Summary: | Despite a variety of Artificial Neural Network (ANN) categories, Backpropagation Network (BP) and Elman Recurrent Network (ERN) are the widespread modus operandi in real applications. However, there are many drawbacks in BP network, for instance, confinement in finding local minimum and may get stuck at regions of a search space or trap in local minima. To solve these problems, various optimization techniques such as Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) have been executed to improve ANN performance. In this study, we exploit errors optimization of Elman Recurrent Network with Backpropagation (ERNBP) and Elman Recurrent Network with Particle Swarm Optimization (ERNPSO) to probe the performance of both networks. The comparisons are done with PSO that is integrated with Neural Network (PSONN) and GA with Neural Network (GANN). The results show that ERNPSO furnishes promising outcomes in terms of classification accuracy and convergence rate compared to ERNBP, PSONN and GANN |
|---|