Do they belong to the same class: active learning by querying pairwise label homogeneity

Publication Type:
Conference Proceeding
CIKM '11 Proceedings of the 20th ACM international conference on Information and knowledge management, 2011, pp. 2161 - 2164
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2011004559OK.pdf415.34 kB
Adobe PDF
Traditional active learning methods request experts to provide ground truths to the queried instances, which can be expensive in practice. An alternative solution is to ask nonexpert labelers to do such labeling work, which can not tell the definite class labels. In this paper, we propose a new active learning paradigm, in which a nonexpert labeler is only asked "whether a pair of instances belong to the same class". To instantiate the proposed paradigm, we adopt the MinCut algorithm as the base classifier. We first construct a graph based on the pairwise distance of all the labeled and unlabeled instances and then repeatedly update the unlabeled edge weights on the max-flow paths in the graph. Finally, we select an unlabeled subset of nodes with the highest prediction confidence as the labeled data, which are included into the labeled data set to learn a new classifier for the next round of active learning. The experimental results and comparisons, with state-of-the-art methods, demonstrate that our active learning paradigm can result in good performance with nonexpert labelers
Please use this identifier to cite or link to this item: