Gaussian process versus margin sampling active learning

Jin Zhou

doi:10.1016/j.neucom.2015.04.086

Return

Gaussian process versus margin sampling active learning

2015-11-01

PRE

Jin Zhou

Shiliang Sun *

DOI：10.1016/j.neucom.2015.04.086

Original

Original request for help

Save

Abstract

En 中文

There are a large number of unlabeled examples in real-world application, and if the labels of these unlabeled examples are given manually, then the cost will be very high. The problem about how to label these massive unlabeled instances with the minimal cost is paid more and more attention. Active learning efficiently solves this bottleneck by selecting the most informative examples from the unlabeled examples and establishing a classifier with a higher classifier accuracy to label unlabeled examples, which greatly improves work efficiency. In this paper, we compare two kinds of traditional active learning algorithms relying on a single classifier, namely Gaussian process and margin sampling active learning, in two aspects of classification error rates and computing time. Moreover, we compare their improved versions (GPMAL and IMS) which apply the manifold-preserving graph reduction (MPGR) algorithm. MPGR constructs a subset which well exploits the structural spatial connectivity and spatial diversity among examples. By using MPGR, an active learner selects the informative and representative candidates from the subset instead of the whole unlabeled data set. In addition, a comparison with a state-of-the-art active learning method, QUIRE, is provided. Experimental results on multiple data sets show that both GPMAL and IMS have their own advantages. (C) 2015 Elsevier B.V. All rights reserved.

Keywords:

Active learning

Gaussian process

Margin sampling

Support vector machine

Manifold-preserving graph reduction

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.