Support Vector Machines

Sven A. Wegner ()

Chapter Chapter 14 in Mathematical Introduction to Data Science, 2024, pp 189-208 from Springer

Abstract: Abstract We stay in the setting of Chapter 13 , but now we want to find the “best” classifier for a linearly separable dataset. More formally, the support vector machine (SVM) is precisely that classifier for which the decision boundary has the largest possible distance to the data. We reduce the task of finding the SVM to a quadratic optimization problem using the Karush-Kuhn-Tucker theorem and then discuss interpretations of the Lagrange multipliers that emerge.

Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-69426-8_14

Ordering information: This item can be ordered from
http://www.springer.com/9783662694268

DOI: 10.1007/978-3-662-69426-8_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().