Skip to content

Support vector machines

Marti A. Hearst, Susan Dumais, E. Osuna, John C. Platt, Bernhard Schölkopf

IEEE Intelligent Systems and their Applications · 1998 · 7,463 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Hearst, M. A., Dumais, S., Osuna, E., Platt, J. C., & Schölkopf, B. (1998). Support vector machines. IEEE Intelligent Systems and Their Applications, 13(4), 18–28. https://doi.org/10.1109/5254.708428

In text: (Hearst et al., 1998)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

My first exposure to Support Vector Machines came this spring when heard Sue Dumais present impressive results on text categorization using this analysis technique. This issue's collection of essays should help familiarize our readers with this interesting new racehorse in the Machine Learning stable. Bernhard Scholkopf, in an introductory overview, points out that a particular advantage of SVMs over other learning algorithms is that it can be analyzed theoretically using concepts from computational learning theory, and at the same time can achieve good performance when applied to real problems. Examples of these real-world applications are provided by Sue Dumais, who describes the aforementioned text-categorization problem, yielding the best results to date on the Reuters collection, and Edgar Osuna, who presents strong results on application to face detection. Our fourth author, John Platt, gives us a practical guide and a new technique for implementing the algorithm efficiently.

  1. LIBSVM2011
  2. Greedy function approximation: A gradient boosting machine.2001
  3. A Survey on Transfer Learning2009
  4. Nearest neighbor pattern classification1967
  5. Representation Learning: A Review and New Perspectives2013

Metadata from OpenAlex (CC0). Citations are generated from the published record.