The Community for Technology Leaders
Green Image
Issue No. 09 - September (2009 vol. 21)
ISSN: 1041-4347
pp: 1233-1248
Steven C.H. Hoi , Nanyang Technological University, Singapore
Rong Jin , Michigan State University, East Lansing
Michael R. Lyu , The Chinese University of Hong Kong, Shatin
Most machine learning tasks in data classification and information retrieval require manually labeled data examples in the training stage. The goal of active learning is to select the most informative examples for manual labeling in these learning tasks. Most of the previous studies in active learning have focused on selecting a single unlabeled example in each iteration. This could be inefficient, since the classification model has to be retrained for every acquired labeled example. It is also inappropriate for the setup of information retrieval tasks where the user's relevance feedback is often provided for the top K retrieved items. In this paper, we present a framework for batch mode active learning, which selects a number of informative examples for manual labeling in each iteration. The key feature of batch mode active learning is to reduce the redundancy among the selected examples such that each example provides unique information for model updating. To this end, we employ the Fisher information matrix as the measurement of model uncertainty, and choose the set of unlabeled examples that can efficiently reduce the Fisher information of the classification model. We apply our batch mode active learning framework to both text categorization and image retrieval. Promising results show that our algorithms are significantly more effective than the active learning approaches that select unlabeled examples based only on their informativeness for the classification model.
Batch mode active learning, logistic regressions, kernel logistic regressions, convex optimization, text categorization, image retrieval.

S. C. Hoi, M. R. Lyu and R. Jin, "Batch Mode Active Learning with Applications to Text Categorization and Image Retrieval," in IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 1233-1248, 2009.
92 ms
(Ver 3.3 (11022016))