.png){kind=icon}
Return
Transfer learning extensions for the probabilistic classification vector machine
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2019.09.104.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Transfer learning is focused on the reuse of supervised learning models in a new context. Prominent applications can be found in robotics, image processing or web mining. In these fields, the learning scenarios are naturally changing but often remain related to each other motivating the reuse of existing supervised models. Current transfer learning models are neither sparse nor interpretable. Sparsity is very desirable if the methods have to be used in technically limited environments and interpretability is getting more critical due to privacy regulations. In this work, we propose two transfer learning extensions integrated into the sparse and interpretable probabilistic classification vector machine. They are compared to standard benchmarks in the field and show their relevance either by sparsity or performance improvements. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Transfer learning
Probabilistic classification vector machine
Transfer kernel learning
Nystrom approximation
Basis transfer
Sparsity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
No organization information available
Cited Papers
Supervised low rank indefinite kernel approximation using minimum enclosing balls.png)
NEUROCOMPUTINGOAAI
NEUROCOMPUTINGIF6.5
OAAIShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more