• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

A Tutorial on Support Vector Machines for Pattern Recognition (1998)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.isode.com]
  • [luthuli.cs.uiuc.edu]
  • [www.cs.princeton.edu]
  • [www.cs.iastate.edu]
  • [www.iro.umontreal.ca]
  • [www-ai.cs.uni-dortmund.de]
  • [guppy.mpe.nus.edu.sg]
  • [oucsace.cs.ohiou.edu]
  • [oucsace.cs.ohiou.edu]
  • [www.isi.uu.nl]
  • [www.umiacs.umd.edu]
  • [www.svms.org]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [www.cs.rochester.edu]
  • [www.umiacs.umd.edu]
  • [www.cse.unr.edu]
  • [www.cs.unr.edu]
  • [www.cs.dal.ca]
  • [www.cs.dal.ca]
  • [www.public.asu.edu]
  • [www.cs.utah.edu]
  • [www.cs.utah.edu]
  • [svms.org]
  • [www.cs.utah.edu]
  • [www.cfar.umd.edu]
  • [www.cs.columbia.edu]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [research.microsoft.com]

  • Other Repositories/Bibliography

  • CiteULike
  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Christopher J.C. Burges
Venue:Data Mining and Knowledge Discovery
Citations:1656 - 11 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

Versions

  • Version 0
  • Version 1
  • Version 2
  • Version 3

Version History

Metadata Version 2

DatumValueSource
TITLE A tutorial on support vector machines for pattern recognition INFERENCE
AUTHOR NAME Christopher J. C. Burges SVM HeaderParse 0.1
AUTHOR AFFIL Bell Laboratories, Lucent Technologies SVM HeaderParse 0.2
AUTHOR ADDR Editor: Usama Fayyad SVM HeaderParse 0.1
ABSTRACT 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. SVM HeaderParse 0.1
YEAR 1998 INFERENCE
VENUE Data Mining and Knowledge Discovery INFERENCE
VENUE TYPE JOURNAL INFERENCE
PAGES 121--167 INFERENCE
VOLUME 2 INFERENCE
CITATIONS 58 found ParsCit 1.0
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University