Absolute convergence and error thresholds in non-active adaptive sampling
Open Access
- 19 May 2022
- journal article
- research article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 129, 39-61
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Modeling of learning curves with applications to POS taggingComputer Speech & Language, 2017
- Boosting instance selection algorithmsKnowledge-Based Systems, 2014
- A stopping criterion for active learningComputer Speech & Language, 2008
- Maximizing classifier utility when there are data acquisition and modeling costsData Mining and Knowledge Discovery, 2007
- Adaptive Sampling Methods for Scaling Up Knowledge Discovery AlgorithmsData Mining and Knowledge Discovery, 2002
- An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and VariantsMachine Learning, 1999
- A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization ProblemsSIAM Journal on Scientific Computing, 1999
- Bagging predictorsMachine Learning, 1996
- The strength of weak learnabilityMachine Learning, 1990