Comparing Support Vector Machines with Gaussian Kernels to Radial Basis Function Classifiers
Author(s)
Schoelkopf, B.
Sung, K.
Burges, C.
Girosi, F.
Niyogi, P.
Poggio, Tomaso A
Vapnik, V.
Date Issued
December 1, 1996
Series/Report no.
AIM-1599
CBCL-142
Abstract
The Support Vector (SV) machine is a novel type of learning machine, based on statistical learning theory, which contains polynomial classifiers, neural networks, and radial basis function (RBF) networks as special cases. In the RBF case, the SV algorithm automatically determines centers, weights and threshold such as to minimize an upper bound on the expected test error. The present study is devoted to an experimental comparison of these machines with a classical approach, where the centers are determined by $k$--means clustering and the weights are found using error backpropagation. We consider three machines, namely a classical RBF machine, an SV machine with Gaussian kernel, and a hybrid system with the centers determined by the SV method and the weights trained by error backpropagation. Our results show that on the US postal service database of handwritten digits, the SV machine achieves the highest test accuracy, followed by the hybrid approach. The SV approach is thus not only theoretically well--founded, but also superior in a practical application.
Subjects
AI
MIT
Artificial Intelligence
radial basis function networks
support vector machines
pattern recognition
machine learning
VC-dimension
performance comparison
model selection
Persistent DSpace Link
