arrow
Return

Feature space approximation for kernel-based supervised learning

delete2021-06-01
delete3
delete
OA
AI
P
Patrick Gelß *
S
Stefan Klus
I
Ingmar Schuster
C
Christof Schütte
DOI:10.1016/j.knosys.2021.106935delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
We propose a method for the approximation of high-or even infinite-dimensional feature vectors, which play an important role in supervised learning. The goal is to reduce the size of the training data, resulting in lower storage consumption and computational complexity. Furthermore, the method can be regarded as a regularization technique, which improves the generalizability of learned target functions. We demonstrate significant improvements in comparison to the computation of data driven predictions involving the full training data set. The method is applied to classification and regression problems from different application areas such as image recognition, system identification, and oceanographic time series analysis. (c) 2021 Elsevier B.V. All rights reserved.
Keywords:
Supervised learning
Kernel-based methods
Feature spaces
Dimensionality reduction
System identification
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

K
Knowledge-Based Systems
IF:
7.6
Papers:
1.2W
Citations:
4.5W

Organization

F
Free University of Berlin
Scholars:
3.8W
Papers: 3.2W
Citations: 51
Zuse Institute Berlin cover
Zuse Institute Berlin
Scholars:
423
Papers: 351
Citations: 367
U
University of Surrey
Scholars:
1.2W
Papers: 1.3W
Citations: 22
researcher View more organizations