Improving radial basis function kernel classification through incremental learning and automatic parameter selection

Training algorithms for radial basis function kernel classifiers (RBFKCs), such as the support vector machine (SVM), often produce computationally burdensome classifiers when large training sets are used. Furthermore, the developer cannot directly control this complexity. The proposed incremental as...

Full description

Saved in:
Bibliographic Details
Published in:Neurocomputing (Amsterdam) 2008-12, Vol.72 (1), p.3-14
Main Authors: Renjifo, Carlos, Barsic, David, Carmen, Craig, Norman, Kevin, Peacock, G. Scott
Format: Article
Language:English
Subjects:
Greedy search
Parameter estimation
Run-time complexity
Simultaneous perturbation stochastic approximation
Support vector machine
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Training algorithms for radial basis function kernel classifiers (RBFKCs), such as the support vector machine (SVM), often produce computationally burdensome classifiers when large training sets are used. Furthermore, the developer cannot directly control this complexity. The proposed incremental asymmetric proximal support vector machine (IAPSVM) employs a greedy search across the training data to select the basis vectors of the classifier, and tunes parameters automatically using the simultaneous perturbation stochastic approximation (SPSA) after incremental additions are made. The resulting classifier accuracy, using an a priori chosen run-time complexity, compares favorably to SVMs of similar complexity whose parameters have been tuned manually.
ISSN:0925-2312
1872-8286
DOI:10.1016/j.neucom.2008.04.053