An adaptive version of the boost by majority algorithm

DOI10.1023/A:1010852229904MaRDI QIDQ5945698zbMATH OpenFDO

Authors Yoav Freund

Publication date 22 July 2002

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1010852229904

zbMATH Keywords

AdaBoostBrownBoost

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• Boosting a weak learning algorithm by majority
• scientific article; zbMATH DE number 1931845
• Adaptive sampling for large scale boosting
• scientific article; zbMATH DE number 2089370
• 10.1162/153244304322765667

Cited in

(27)

• Parallelizing AdaBoost by weights dynamics
• Drifting games and Brownian motion
• Noise peeling methods to improve boosting algorithms
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Random classification noise defeats all convex potential boosters
• On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms
• Utilizing adaptive boosting to detect quantum steerability
• Analyzing high dimensional correlated data using feature ranking and classifiers
• GA-Ensemble: a genetic algorithm for robust ensembles
• Multi-class learning by smoothed boosting
• Parsimonious reduction of Gaussian mixture models with a variational-Bayes approach
• scientific article; zbMATH DE number 2086343 (Why is no real title available?)
• scientific article; zbMATH DE number 2089433 (Why is no real title available?)
• Boosting the partial least square algorithm for regression modelling
• A note on implementations of the boosting algorithm and heterogeneous multiscale methods
• scientific article; zbMATH DE number 1966609 (Why is no real title available?)
• Delta Boosting Machine with Application to General Insurance
• scientific article; zbMATH DE number 1884340 (Why is no real title available?)
• Boosting in the presence of outliers: adaptive classification with nonconvex loss functions
• Data reduction in classification: A simulated annealing based projection method
• A learning algorithm to select consistent reactions to human movements
• The AdaBoost flow
• An empirical comparison of ensemble methods based on classification trees
• AdaBoost Semiparametric Model Averaging Prediction for Multiple Categories
• Soft-max boosting
• Quadratic Majorization for Nonconvex Loss with Applications to the Boosting Algorithm
• Robust boosting with truncated loss functions

This page was built for publication: An adaptive version of the boost by majority algorithm

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