As an effective algorithm that integrates weak learners into a strong one, AdaBoost has found its application in various fields. Traditional AdaBoost works under the supervised learning scenario. Typically, with a limited number of labeled instances available, the learning performance is jeopardized. In this paper, we propose a novel Dual-Lane AdaBoost algorithm, which introduces semi-supervised learning into AdaBoost. On one hand, weak learners pass the weights on the labeled instances to the subsequent ones. On the other hand, the unlabeled instances with high confidence are recommended from one weak learner to another. From the perspective of information flow, we establish a dual-lane path between the weak learners. In this way, both the labeled and the unlabeled instances are fully explored and exploited. Consequently, the integrated strong learner can be remarkably improved. Experimental results on the malware dataset demonstrate the effectiveness of the proposed algorithm.
[1]
Changsheng Xu,et al.
Effective Annotation and Search for Video Blogs with Integration of Context and Content Analysis
,
2009,
IEEE Trans. Multim..
[2]
Xiaoyu Zhang,et al.
Update vs. upgrade: Modeling with indeterminate multi-class active learning
,
2015,
Neurocomputing.
[3]
D. Ruppert.
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
,
2004
.
[4]
Xiaoyu Zhang,et al.
Bidirectional Active Learning: A Two-Way Exploration Into Unlabeled and Labeled Data Set
,
2015,
IEEE Transactions on Neural Networks and Learning Systems.
[5]
Xiaoyu Zhang,et al.
Interactive patent classification based on multi-classifier fusion and active learning
,
2014,
Neurocomputing.