An Improved Gauss-Newtons Method based Back-propagation Algorithm for Fast Convergence

  • Nandy S
  • Das A
  • Pratim Sarkar P
N/ACitations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

The present work deals with an improved back-propagation algorithm based on Gauss-Newton numerical optimization method for fast convergence. The steepest descent method is used for the back-propagation. The algorithm is tested using various datasets and compared with the steepest descent back-propagation algorithm. In the system, optimization is carried out using multilayer neural network. The efficacy of the proposed method is observed during the training period as it converges quickly for the dataset used in test. The requirement of memory for computing the steps of algorithm is also analyzed.

Cite

CITATION STYLE

APA

Nandy, S., Das, A., & Pratim Sarkar, P. (2012). An Improved Gauss-Newtons Method based Back-propagation Algorithm for Fast Convergence. International Journal of Computer Applications, 39(8), 1–7. https://doi.org/10.5120/4837-7097

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