Kernel methods in machine learning

From MaRDI portal
Publication:930651

DOI10.1214/009053607000000677zbMATH Open1151.30007arXivmath/0701907OpenAlexW3101749733WikidataQ93514201 ScholiaQ93514201MaRDI QIDQ930651FDOQ930651

Bernhard Schölkopf, Thomas Hofmann, Alex J. Smola

Publication date: 1 July 2008

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: We review machine learning methods employing positive definite kernels. These methods formulate learning and estimation problems in a reproducing kernel Hilbert space (RKHS) of functions defined on the data domain, expanded in terms of a kernel. Working in linear spaces of function has the benefit of facilitating the construction and analysis of learning algorithms while at the same time allowing large classes of functions. The latter include nonlinear functions as well as functions defined on nonvectorial data. We cover a wide range of methods, ranging from binary classifiers to sophisticated methods for estimation with structured data.


Full work available at URL: https://arxiv.org/abs/math/0701907




Recommendations




Cites Work


Cited In (only showing first 100 items - show all)

Uses Software





This page was built for publication: Kernel methods in machine learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930651)