Combining Committee-Based Semi-Supervised Learning and Active Learning

<正>Many data mining applications have a large amount of data but labeling data is usually difficult,expensive,or time consuming,as it requires human experts for annotation.Semi-supervised learning addresses this problem by using unlabeled data together with labeled data in the training process.Co-Training is a popular semi-supervised learning algorithm that has the assumptions that each example is represented by multiple sets of features(views) and these views are sufficient for learning and independent given the class.However,these assumptions are strong and are not satisfied in many real-world domains.In this paper,a single-view variant of Co-Training,called Co-Training by Committee(CoBC) is proposed,in which an ensemble of diverse classifiers is used instead of redundant and independent views.We introduce a new labeling confidence measure for unlabeled examples based on estimating the local accuracy of the committee members on its neighborhood.Then we introduce two new learning algorithms,QBC-then-CoBC and QBC-with-CoBC,which combine the merits of committee-based semi-supervised learning and active learning.The random subspace method is applied on both C4.5 decision trees and 1-nearest neighbor classifiers to construct the diverse ensembles used for semi-supervised learning and active learning.Experiments show that these two combinations can outperform other non committee-based ones.