CSLM: Levenberg Marquardt based Back Propagation Algorithm Optimized with Cuckoo Search  

Oleh:

Nawi, Nazri Mohd. ; Khan, Abdullah ; Rehman, M. Z.

Jenis: Article from Journal - ilmiah nasional - terakreditasi DIKTI
Dalam koleksi: Journal of ICT Research and Applications vol. 7C no. 2 (2013), page 103-116.
Topik: artificial neural networks; back propagation; cuckoo search; levenberg marquardt; local minima.
Fulltext: C13382.pdf (149.97KB)

Isi artikel

Training an artificial neural network is an optimization task, since it is desired to find optimal weight sets for a neural network during training process. Traditional training algorithms such as back propagation have some drawbacks such as getting stuck in local minima and slow speed of convergence. This study combines the best features of two algorithms; i.e. Levenberg Marquardt back propagation (LMBP) and Cuckoo Search (CS) for improving the convergence speed of artificial neural networks (ANN) training. The proposed CSLM algorithm is trained on XOR and OR datasets. The experimental results show that the proposed CSLM algorithm has better performance than other similar hybrid variants used in this study.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali