Multi-Class Active Learning by Uncertainty Sampling with Diversity Maximization

被引:346
作者
Yang, Yi [1 ]
Ma, Zhigang [2 ]
Nie, Feiping [3 ]
Chang, Xiaojun [1 ]
Hauptmann, Alexander G. [2 ]
机构
[1] Univ Technol Sydney, Ctr Quantum Computat & Intelligent Syst, Sydney, NSW 2007, Australia
[2] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA 15213 USA
[3] Northwestern Polytech Univ, Ctr OPT IMagery Anal & Learning, Xian 710072, Peoples R China
基金
澳大利亚研究理事会;
关键词
Active learning; Uncertainty sampling; Diversity maximization; ADAPTATION; KNOWLEDGE;
D O I
10.1007/s11263-014-0781-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
As a way to relieve the tedious work of manual annotation, active learning plays important roles in many applications of visual concept recognition. In typical active learning scenarios, the number of labelled data in the seed set is usually small. However, most existing active learning algorithms only exploit the labelled data, which often suffers from over-fitting due to the small number of labelled examples. Besides, while much progress has been made in binary class active learning, little research attention has been focused on multi-class active learning. In this paper, we propose a semi-supervised batch mode multi-class active learning algorithm for visual concept recognition. Our algorithm exploits the whole active pool to evaluate the uncertainty of the data. Considering that uncertain data are always similar to each other, we propose to make the selected data as diverse as possible, for which we explicitly impose a diversity constraint on the objective function. As a multi-class active learning algorithm, our algorithm is able to exploit uncertainty across multiple classes. An efficient algorithm is used to optimize the objective function. Extensive experiments on action recognition, object classification, scene recognition, and event detection demonstrate its advantages.
引用
收藏
页码:113 / 127
页数:15
相关论文
共 43 条
[1]  
[Anonymous], 1999, Nonlinear Programming
[2]  
[Anonymous], 2012, ACM SIGKDD
[3]  
[Anonymous], 2009, CVPR
[4]  
[Anonymous], 2000, ICML
[5]  
[Anonymous], 2006, 2006 IEEE COMP SOC C
[6]  
[Anonymous], CVPR
[7]  
[Anonymous], 2008, Technical report
[8]  
[Anonymous], 2009, CVPR
[9]  
Brinker K., 2003, INT C MACH LEARN
[10]  
Chen M.y., 2009, Tech. Rep. CMU-CS- 09-161