Improvement of boosting algorithm by modifying the weighting rule

DOI10.1023/B:AMAI.0000018577.32783.D2MaRDI QIDQ596493zbMATH OpenOpenAlexFDO

Authors Masayuki Nakamura, Hiroki Nomiya, Kuniaki Uehara

Publication date 10 August 2004

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:amai.0000018577.32783.d2

zbMATH Keywords

AdaBoosterrorboundhard exampleNadaBoostweighting rule

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32)

Recommendations

• An efficient modified boosting method for solving classification problems
• A boosting approach to remove class label noise1
• AdaBoost algorithm using multi-step correction
• The boosting approach to machine learning: an overview
• Weighted bagging: a modification of AdaBoost from the perspective of importance sampling

Cited in

(11)

• Weighted bagging: a modification of AdaBoost from the perspective of importance sampling
• scientific article; zbMATH DE number 2044159 (Why is no real title available?)
• AdaBoost algorithm using multi-step correction
• Robustifying AdaBoost by Adding the Naive Error Rate
• scientific article; zbMATH DE number 2089097 (Why is no real title available?)
• scientific article; zbMATH DE number 1931839 (Why is no real title available?)
• scientific article; zbMATH DE number 2043443 (Why is no real title available?)
• An efficient modified boosting method for solving classification problems
• An improved boosting algorithm for small and imbalanced training sets
• An improvement of AdaBoost for face detection with random forests
• A new boosting-based software reliability growth model

This page was built for publication: Improvement of boosting algorithm by modifying the weighting rule

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