Adaptive conjugate gradient algorithm for perceptron training

Authors:
G. Nagaraja;R.P. Jagadeesh Chandra Bose
Affiliations:
Department of Computer Science and Engineering, IIT Bombay, Mumbai 400 076, India;Department of Computer Science and Engineering, IIT Bombay, Mumbai 400 076, India
Venue:
Neurocomputing
Year:
2006

Citing 6
Cited 2

Bioinformatics: the machine learning approach

Bioinformatics: the machine learning approach
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
Interactive Pattern Recognition: Techniques and Systems

Computer
An Algorithm for the Solution of Linear Inequalities

IEEE Transactions on Computers
A Nonlinear Mapping for Data Structure Analysis

IEEE Transactions on Computers
Adaptive Ho-Kashyap rules for perceptron training

IEEE Transactions on Neural Networks

Counting eosinophils in bronchoalveolar lavage fluid images with fuzzy methodology

Applied Soft Computing
Perceptron training algorithms designed using discrete-time control Liapunov functions

Neurocomputing

Quantified Score

Hi-index	0.01

Visualization

Abstract

An adaptive algorithm for function minimization based on conjugate gradients for the problem of finding linear discriminant functions in pattern classification is developed. The algorithm converges to a solution in both consistent and inconsistent cases in a finite number of steps on several datasets. We have applied our algorithm and compared its performance with the adaptive versions of the Ho-Kashyap procedure (AHK). We have also compared the batch version of the algorithm with the batch mode AHK. The results show that the proposed adaptive conjugate gradient algorithm (CGA) gives vastly superior performance in terms of both the number of training cycles required and the classification rate. Also, the batch mode CGA performs much better than the batch mode AHK.