A Bayesian boosting theorem

DOI10.1016/S0167-8655(00)00137-9MaRDI QIDQ4795035zbMATH OpenOpenAlexFDO

Authors Richard Nock, Marc Sebban

Publication date 20 February 2003

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8655(00)00137-9

zbMATH Keywords

feature selectionboostingBayes riskrisk bounds

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

• Boosting conditional probability estimators
• A stochastic approximation view of boosting
• Some theory for generalized boosting algorithms
• On the Bayes-risk consistency of regularized boosting methods.
• scientific article; zbMATH DE number 1367593
• A theory of multiclass boosting
• Bayesian analog of Gleason’s theorem
• scientific article; zbMATH DE number 2088081

Cited in

(4)

• On the Bayes-risk consistency of regularized boosting methods.
• Theory of optimal Bayesian feature filtering
• The synergy between PAV and AdaBoost
• The synergy between PAV and AdaBoost

This page was built for publication: A Bayesian boosting theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4795035)