63 search results - page 4 / 13 » Complexity Bounds for Batch Active Learning in Classificatio... |
92
Voted
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we propose a two-dimensional active learning scheme and show its application in image classification. Traditional active learning methods select samples only along ...
ALT
2006
Springer
15 years 8 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
93
Voted
NIPS
2004
15 years 1 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
108
Voted
ESANN
2006
15 years 1 months ago
2006
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
NIPS
2007
15 years 1 months ago
2007
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...