Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.knosys.2021.106935 | Knowledge-Based Systems |
Keywords | DocType | Volume |
68Q27,68Q32,68T09 | Journal | 221 |
ISSN | Citations | PageRank |
0950-7051 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patrick Gelß | 1 | 0 | 1.35 |
| Stefan Klus | 2 | 17 | 6.09 |
| Ingmar Schuster | 3 | 0 | 0.68 |
| Christof Schütte | 4 | 167 | 35.19 |