Studying the Effect of Optimizing Weights in Neural Networks with Meta-Heuristic Techniques

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Meta-heuristic algorithms provide derivative-free solutions to optimize complex problems. Back-propagation Neural Network (BP) algorithm is one of the most commonly used and a popular technique to optimize the feed forward neural network training. Traditional BP algorithm has some drawbacks, such as getting stuck easily in local minima and slow speed of convergence. This paper proposed a new meta-heuristic search algorithm, called cuckoo search (CS), based on cuckoo bird’s behavior to train back propagation (BP), Elman Recurrent Neural Network (RNN), and Levenberg Marquardt (LM) algorithms to achieving fast convergence rate and to avoid local minima problem. The performances of the proposed hybrid Cuckoo Search algorithms are compared with artificial bee colony using BP algorithm, and other hybrid variant. Specifically on Iris and 7-Bit parity datasets are used. The simulation results show that the hybrid Cuckoo Search show better performances than the other hybrid technique.

Cite

CITATION STYLE

APA

Nawi, N. M., Khan, A., Rehman, M. Z., Naseem, R., & Uddin, J. (2019). Studying the Effect of Optimizing Weights in Neural Networks with Meta-Heuristic Techniques. In Lecture Notes in Electrical Engineering (Vol. 520, pp. 323–330). Springer Verlag. https://doi.org/10.1007/978-981-13-1799-6_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free