Bounds on error expectation for support vector machines

被引:608
作者
Vapnik, V [1 ]
Chapelle, O [1 ]
机构
[1] Ecole Normale Super Lyon, AT&T Labs Res, F-69364 Lyon, France
关键词
D O I
10.1162/089976600300015042
中图分类号
TP18 [人工智能理论];
学科分类号
081104 [模式识别与智能系统]; 0812 [计算机科学与技术]; 0835 [软件工程]; 1405 [智能科学与技术];
摘要
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 demonstate 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).
引用
收藏
页码:2013 / 2036
页数:24
相关论文
共 8 条
[1]
[Anonymous], P 5 ANN WORKSH COMP
[2]
[Anonymous], 1999, 99035 NEUROCOLT
[3]
Bartlett P, 1999, ADVANCES IN KERNEL METHODS, P43
[4]
LUNTZ A, 1969, TECHICHESKAYA KIBERN, V3
[5]
SHAWETAYLOR J, 1998, IEEE T INFORMATION T
[6]
Vapnik V, 1999, NATURE STAT LEARNING
[7]
Vapnik V., 1998, STAT LEARNING THEORY, V1, P2
[8]
WESTON J, 1999, ADV LARGE MARGIN CLA