Set-Based Boosting for Instance-Level Transfer on Multi-Classification

Haibo YIN  Jun-an YANG  Wei WANG  Hui LIU  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E100-D   No.5   pp.1079-1086
Publication Date: 2017/05/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2016EDP7373
Type of Manuscript: PAPER
Category: Pattern Recognition
Keyword: 
transfer learning,  boosting,  multi-classification,  Hamming loss,  extreme learning machine,  

Full Text: PDF(1.2MB)>>
Buy this Article




Summary: 
Transfer boosting, a branch of instance-based transfer learning, is a commonly adopted transfer learning method. However, currently popular transfer boosting methods focus on binary classification problems even though there are many multi-classification tasks in practice. In this paper, we developed a new algorithm called MultiTransferBoost on the basis of TransferBoost for multi-classification. MultiTransferBoost firstly separated the multi-classification problem into several orthogonal binary classification problems. During each iteration, MultiTransferBoost boosted weighted instances from different source domains while each instance's weight was assigned and updated by evaluating the difficulty of the instance being correctly classified and the “transferability” of the instance's corresponding source domain to the target. The updating process repeated until it reached the predefined training error or iteration number. The weight update factors, which were analyzed and adjusted to minimize the Hamming loss of the output coding, strengthened the connections among the sub binary problems during each iteration. Experimental results demonstrated that MultiTransferBoost had better classification performance and less computational burden than existing instance-based algorithms using the One-Against-One (OAO) strategy.