Explaining AdaBoost

DOI10.1007/978-3-642-41136-6_5zbMATH Open1330.68252OpenAlexW4244895750MaRDI QIDQ5264087FDOQ5264087

Authors: Robert E. Schapire 

Publication date: 20 July 2015

Published in: Empirical Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-41136-6_5

Recommendations

• The boosting approach to machine learning: an overview
• Boosting. Foundations and algorithms.
• Machine learning. The art and science of algorithms that make sense of data.
• scientific article; zbMATH DE number 1950578
• scientific article

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (12)

• Fuzzy Gaussian decision tree
• The boosting approach to machine learning: an overview
• Title not available (Why is that?)
• Trade-off between bagging and boosting for quantum separability-entanglement classification
• Title not available (Why is that?)
• Structure from Randomness in Halfspace Learning with the Zero-One Loss
• Title not available (Why is that?)
• Feature extraction using conformal geometric algebra for AdaBoost algorithm based in-plane rotated face detection
• Cost-sensitive boosting algorithms: do we really need them?
• Boosting in the Presence of Outliers: Adaptive Classification With Nonconvex Loss Functions
• Title not available (Why is that?)
• Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques

This page was built for publication: Explaining AdaBoost

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