Kernel Method

Sven A. Wegner ()

Chapter Chapter 15 in Mathematical Introduction to Data Science, 2024, pp 209-224 from Springer

Abstract: Abstract Next, we consider datasets that are not linearly separable. In order to treat these with the methods of the last two chapters, we map our not linearly separable dataset into a higher-dimensional (sometimes even infinite-dimensional!) space. If this “embedded dataset” is linearly separable, then we may apply the perceptron algorithm or the SVM method and obtain an induced classifier for the original data. The latter leads to the so-called kernel trick, where one does not even need to know the higher-dimensional space explicitly, but can, by using only a kernel function, determine a classifier through solving a quadratic optimization problem. We address the existence of kernel functions by considering Mercer’s condition.

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_15

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

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

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 ().