dc.contributor.author |
Sukhija, S. |
|
dc.contributor.author |
Narayanan, C.K. |
|
dc.date.accessioned |
2018-12-20T05:31:24Z |
|
dc.date.available |
2018-12-20T05:31:24Z |
|
dc.date.issued |
2018-12-20 |
|
dc.identifier.uri |
http://localhost:8080/xmlui/handle/123456789/1018 |
|
dc.description.abstract |
Transfer learning across heterogeneous feature spaces can, in general, be a very difficult problem in practice due to the heterogeneity of features and lack of correspondence between data points of different domains. In this paper, we present a novel supervised domain adaptation algorithm (SHDA-RF) that transfers knowledge from a data-rich source domain to a target domain with only few training instances. The proposed method makes use of random forests to identify pivot features that bridge the two domains. The key idea of the proposed feature transfer approach is that every path in a decision tree leading to a partition of the data is associated with a certain label distribution and the label distributions that appear both in the source and target random forest models can be used as pivots for bridging the two domains. This information is used to generate a sparse feature transformation matrix, which maps patterns from the source feature space to the target feature space. The target model is then retrained along with the projected source data. We conduct extensive experiments on diverse datasets of varying dimensions and sparsity to verify the superiority of the proposed approach over other baseline and state of the art transfer approaches. |
en_US |
dc.language.iso |
en_US |
en_US |
dc.subject |
Feature transfer learning |
en_US |
dc.subject |
Heterogeneous domain adaptation |
en_US |
dc.subject |
Random forests |
en_US |
dc.title |
Supervised heterogeneous feature transfer via random forests |
en_US |
dc.type |
Article |
en_US |