Abstract
We propose novel model transfer-learning methods that refine a decision forest model $M$ learned within a 'source' domain using a training set sampled from a 'target' domain, assumed to be a variation of the source. We present two random forest transfer algorithms. The first algorithm searches greedily for locally optimal modifications of each tree structure by trying to locally expand or reduce the tree around individual nodes. The second algorithm does not modify structure, but only the parameter (thresholds) associated with decision nodes. We also propose to combine both methods by considering an ensemble that contains the union of the two forests. The proposed methods exhibit impressive experimental results over a range of problems.
Original language | English |
---|---|
Article number | 7592407 |
Pages (from-to) | 1811-1824 |
Number of pages | 14 |
Journal | IEEE Transactions on Pattern Analysis and Machine Intelligence |
Volume | 39 |
Issue number | 9 |
DOIs | |
State | Published - 1 Sep 2017 |
Keywords
- Transfer learning
- decision tree
- model transfer
- random forest
All Science Journal Classification (ASJC) codes
- Software
- Computer Vision and Pattern Recognition
- Computational Theory and Mathematics
- Artificial Intelligence
- Applied Mathematics