%0 Journal Article %1 Burges1998 %A Burges, Christopher J. C. %C Hingham, MA, USA %D 1998 %I Kluwer Academic Publishers %J Data Min. Knowl. Discov. %K machine-learning svm %N 2 %P 121--167 %R http://dx.doi.org/10.1023/A:1009715923555 %T A Tutorial on Support Vector Machines for Pattern Recognition %V 2 %X The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-separable data, working through a non-trivial example in detail. We describe a mechanical analogy, and discuss when SVM solutions are unique and when they are global. We describe how support vector training can be practically implemented, and discuss in detail the kernel mapping technique which is used to construct SVM solutions which are nonlinear in the data. We show how Support Vector machines can have very large (even infinite) VC dimension by computing the VC dimension for homogeneous polynomial and Gaussian radial basis function kernels. While very high VC dimension would normally bode ill for generalization performance, and while at present there exists no theory which shows that good generalization performance is guaranteed for SVMs, there are several arguments which support the observed high accuracy of SVMs, which we review. Results of some experiments which were inspired by these arguments are also presented. We give numerous examples and proofs of most of the key theorems. There is new material, and I hope that the reader will find that even old material is cast in a fresh light.

@article{Burges1998, abstract = {The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-separable data, working through a non-trivial example in detail. We describe a mechanical analogy, and discuss when SVM solutions are unique and when they are global. We describe how support vector training can be practically implemented, and discuss in detail the kernel mapping technique which is used to construct SVM solutions which are nonlinear in the data. We show how Support Vector machines can have very large (even infinite) VC dimension by computing the VC dimension for homogeneous polynomial and Gaussian radial basis function kernels. While very high VC dimension would normally bode ill for generalization performance, and while at present there exists no theory which shows that good generalization performance is guaranteed for SVMs, there are several arguments which support the observed high accuracy of SVMs, which we review. Results of some experiments which were inspired by these arguments are also presented. We give numerous examples and proofs of most of the key theorems. There is new material, and I hope that the reader will find that even old material is cast in a fresh light.}, added-at = {2012-11-11T15:31:15.000+0100}, address = {Hingham, MA, USA}, author = {Burges, Christopher J. C.}, biburl = {https://www.bibsonomy.org/bibtex/2287ff185646e020c301c2cc0ae9ed8a0/bsc}, doi = {http://dx.doi.org/10.1023/A:1009715923555}, file = {Burges1998.pdf:1998/Burges1998.pdf:PDF}, groups = {public}, interhash = {2d37bd146ae27e7251296b0b7f1f4a61}, intrahash = {287ff185646e020c301c2cc0ae9ed8a0}, issn = {1384-5810}, journal = {Data Min. Knowl. Discov.}, keywords = {machine-learning svm}, number = 2, pages = {121--167}, publisher = {Kluwer Academic Publishers}, timestamp = {2012-11-11T15:31:15.000+0100}, title = {A Tutorial on Support Vector Machines for Pattern Recognition}, username = {jabreftest}, volume = 2, year = 1998 }