articleTop 10% cited
Bounds on Error Expectation for Support Vector Machines
Neural Computation · 2000 · Vol. 12(9) · pp. 2013–2036
Vladimir Vapnik✉(École Normale Supérieure de Lyon)Olivier Chapelle(École Normale Supérieure de Lyon)
Abstract
We introduce the concept of span of support vectors (SV) and show that the generalization ability of support vector machines (SVM) depends on this new geometrical concept. We prove that the value of the span is always smaller (and can be much smaller) than the diameter of the smallest sphere containing the support vectors, used in previous bounds (Vapnik, 1998). We also demonstrate experimentally that the prediction of the test error given by the span is very accurate and has direct application in model selection (choice of the optimal parameters of the SVM).
Face and Expression RecognitionNeural Networks and ApplicationsSparse and Compressive Sensing TechniquesSupport vector machineGeneralizationSpan (engineering)Value (mathematics)MathematicsComputer scienceSelection (genetic algorithm)Artificial neural networkArtificial intelligenceAlgorithm
MeSH terms
LearningModels, NeurologicalPattern Recognition, AutomatedNeural Networks, Computer
Citations
622
FWCI
12.47
field-weighted impact
References
10
Percentile
99%
vs. same field & year
Citations per year
Cited by
Asymptotic Behaviors of Support Vector Machines with Gaussian Kernel
Neural Computation · 2003 · 1,607 citations
An introduction to kernel-based learning algorithms
IEEE Transactions on Neural Networks · 2001 · 3,478 citations
Evaluation of simple performance measures for tuning SVM hyperparameters
Neurocomputing · 2003 · 637 citations
Choosing Multiple Parameters for Support Vector Machines
Machine Learning · 2002 · 2,176 citations
References
An introduction to kernel-based learning algorithms
IEEE Transactions on Neural Networks · 2001 · 3,478 citations
Statistical Learning Theory
Technometrics · 1999 · 26,915 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.
