Anytime classification for a pool of instances
From MaRDI portal
Publication:1959521
DOI10.1007/s10994-009-5118-6zbMath1473.62222OpenAlexW2002432783WikidataQ62833630 ScholiaQ62833630MaRDI QIDQ1959521
Geoffrey I. Webb, Bei Hui, Ying Yang
Publication date: 7 October 2010
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-009-5118-6
ensemble learninganytime classificationBayesian probabilistic classifierscomputational resource constraints
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classifying under computational resource constraints: anytime classification using probabilistic estimators
- A model selection approach to signal denoising using Kullback's symmetric divergence
- Not so naive Bayes: Aggregating one-dependence estimators
- Boosting the margin: a new explanation for the effectiveness of voting methods
- On Information and Sufficiency
- A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
- An invariant form for the prior probability in estimation problems
This page was built for publication: Anytime classification for a pool of instances