TY - GEN
T1 - Online Bagging for Anytime Transfer Learning
AU - Chi, Guokun
AU - Jiang, Min
AU - Gao, Xing
AU - Hu, Weizhen
AU - Guo, Shihui
AU - Tan, Kay Chen
N1 - Funding Information:
This work was supported by the National Natural Science Foundation of China (Grant No.61673328) and Shenzhen Scientific Research and Development Funding Program (Grant No. JCYJ20180307123637294).
Publisher Copyright:
© 2019 IEEE.
PY - 2019/12
Y1 - 2019/12
N2 - Transfer learning techniques have been widely used in the reality that it is difficult to obtain sufficient labeled data in the target domain, but a large amount of auxiliary data can be obtained in the relevant source domain. But most of the existing methods are based on offline data. In practical applications, it is often necessary to face online learning problems in which the data samples are achieved sequentially. In this paper, We are committed to applying the ensemble approach to solving the problem of online transfer learning so that it can be used in anytime setting. More specifically, we propose a novel online transfer learning framework, which applies the idea of online bagging methods to anytime transfer learning problems, and constructs strong classifiers through online iterations of the usefulness of multiple weak classifiers. Further, our algorithm also provides two extension schemes to reduce the impact of negative transfer. Experiments on three real data sets show that the effectiveness of our proposed algorithms.
AB - Transfer learning techniques have been widely used in the reality that it is difficult to obtain sufficient labeled data in the target domain, but a large amount of auxiliary data can be obtained in the relevant source domain. But most of the existing methods are based on offline data. In practical applications, it is often necessary to face online learning problems in which the data samples are achieved sequentially. In this paper, We are committed to applying the ensemble approach to solving the problem of online transfer learning so that it can be used in anytime setting. More specifically, we propose a novel online transfer learning framework, which applies the idea of online bagging methods to anytime transfer learning problems, and constructs strong classifiers through online iterations of the usefulness of multiple weak classifiers. Further, our algorithm also provides two extension schemes to reduce the impact of negative transfer. Experiments on three real data sets show that the effectiveness of our proposed algorithms.
KW - ensemble learning
KW - negative transfer
KW - online bagging
KW - online transfer learning
UR - http://www.scopus.com/inward/record.url?scp=85080921983&partnerID=8YFLogxK
U2 - 10.1109/SSCI44817.2019.9002755
DO - 10.1109/SSCI44817.2019.9002755
M3 - Conference article published in proceeding or book
AN - SCOPUS:85080921983
T3 - 2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019
SP - 941
EP - 947
BT - 2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE Symposium Series on Computational Intelligence, SSCI 2019
Y2 - 6 December 2019 through 9 December 2019
ER -