A training algorithm for optimal margin classifiers

Abstract

A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented. The technique is applicable to a wide variety of the classification functions, including Perceptrons, polynomials, and Radial Basis Functions. The effective number of parameters is adjusted automatically to match the complexity of the problem. The solution is expressed as a linear combination of supporting patterns. These are the subset of training patterns that are closest to the decision boundary. Bounds on the generalization performance based on the leave-one-out method and the VC-dimension are given. Experimental results on optical character recognition problems demonstrate the good generalization obtained when compared with other learning algorithms.

Cite this paper

Related papers

1. Long Short-Term Memory1997
2. Gradient-based learning applied to document recognition1998
3. Particle swarm optimization2002
4. LIBSVM2011
5. Greedy function approximation: A gradient boosting machine.2001