Premium
A survey on online kernel selection for online kernel learning
Author(s) -
Zhang Xiao,
Liao Yun,
Liao Shizhong
Publication year - 2018
Publication title -
wiley interdisciplinary reviews: data mining and knowledge discovery
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.506
H-Index - 47
eISSN - 1942-4795
pISSN - 1942-4787
DOI - 10.1002/widm.1295
Subject(s) - kernel (algebra) , computer science , radial basis function kernel , kernel method , kernel embedding of distributions , selection (genetic algorithm) , machine learning , tree kernel , polynomial kernel , multiple kernel learning , regret , artificial intelligence , kernel smoother , mathematics , support vector machine , combinatorics
Online kernel selection is fundamental to online kernel learning. In contrast to offline kernel selection, online kernel selection intermixes kernel selection and training at each round of online kernel learning, and requires a sublinear regret bound and low computational complexity. In this paper, we first compare the difference between offline kernel selection and online kernel selection, then survey existing online kernel selection approaches from the perspectives of formulation, algorithm, candidate kernels, computational complexities and regret guarantees, and finally point out some future research directions in online kernel selection. This article is categorized under: Technologies > Machine Learning Fundamental Concepts of Data and Knowledge > Key Design Issues in Data Mining