63 search results - page 3 / 13 » Complexity Bounds for Batch Active Learning in Classificatio... |
ICPR
2000
IEEE
14 years 6 months ago
2000
IEEE
An algorithmfor data condensation using support vector machines (SVM's)is presented. The algorithm extracts datapoints lying close to the class boundaries,whichform a much re...
SIGIR
2010
ACM
13 years 5 months ago
2010
ACM
In recent years, active learning methods based on experimental design achieve state-of-the-art performance in text classification applications. Although these methods can exploit ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with L2 regularization: We introduce the -adapted-dimension, which...
STOC
1993
ACM
13 years 9 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
ALT
2010
Springer
13 years 7 months ago
2010
Springer
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...