Comparing support vector machines with Gaussian kernels to radial basis function classifiers

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 that 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 X-means clustering, and the weights are computed 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 United States postal service database of handwritten digits, the SV machine achieves the highest recognition accuracy, followed by the hybrid system. The SV approach is thus not only theoretically well-founded but also superior in a practical application

The association between “Brain‐Age Score” (BAS) and traditional neuropsychological screening tools in Alzheimer's disease

“…More information about the theoretical background of the SVR can be found in (Scholkopf et al., 1997; Smola & Schölkopf, 2004; Vapnik, 2013; Welling, 2004). …”

Neural network based detection of hard exudates in retinal images

“…Depending on the selected inner-product kernel, we can construct different types of machines, including two-layer perceptrons and RBFs [29,35]. However, there are some differences with the classical algorithms:…”

“…In classical RBF classifiers; they have to be determined in advance, usually by some kind of clustering method [29,35].…”

A novel semisupervised support vector machine classifier based on active learning and context information

“…A standard SVM is based on the structural risk minimization 11 to classify the learning set by extracting the support vectors from the training set to find the optimal 12 hyper plane (Scholkopf et al 1997). In case of the binary SVM, given the training set Land the testing 13 set U, it is limited to the following constrained optimization problem (Izquierdo-Verdiguier et al 14 2013): 15…”