Sciweavers

63 search results - page 2 / 13
» Complexity Bounds for Batch Active Learning in Classificatio...
Sort
View
JMLR
2008
117views more  JMLR 2008»
13 years 4 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
ICML
2007
IEEE
14 years 5 months ago
A bound on the label complexity of agnostic active learning
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
Steve Hanneke
ICML
2003
IEEE
14 years 5 months ago
Incorporating Diversity in Active Learning with Support Vector Machines
In many real world applications, active selection of training examples can significantly reduce the number of labelled training examples to learn a classification function. Differ...
Klaus Brinker
COLT
2008
Springer
13 years 6 months ago
The True Sample Complexity of Active Learning
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
Maria-Florina Balcan, Steve Hanneke, Jennifer Wort...
TIP
2008
185views more  TIP 2008»
13 years 4 months ago
Active Learning Methods for Interactive Image Retrieval
Active learning methods have been considered with increased interest in the statistical learning community. Initially developed within a classification framework, a lot of extensio...
Philippe Henri Gosselin, Matthieu Cord