An adaptive version of the boost by majority algorithm

DOI10.1023/A:1010852229904zbMath0988.68150MaRDI QIDQ5945698

Yoav Freund

Publication date: 22 July 2002

Published in: Machine Learning (Search for Journal in Brave)

zbMATH Keywords

AdaBoostBrownBoost

Mathematics Subject Classification ID

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

Related Items (20)

AdaBoost Semiparametric Model Averaging Prediction for Multiple Categories ⋮ Utilizing adaptive boosting to detect quantum steerability ⋮ Boosting the partial least square algorithm for regression modelling ⋮ Multi-class learning by smoothed boosting ⋮ Noise peeling methods to improve boosting algorithms ⋮ Parsimonious reduction of Gaussian mixture models with a variational-Bayes approach ⋮ Analyzing high dimensional correlated data using feature ranking and classifiers ⋮ Random classification noise defeats all convex potential boosters ⋮ On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms ⋮ An empirical comparison of ensemble methods based on classification trees ⋮ GA-Ensemble: a genetic algorithm for robust ensembles ⋮ Quadratic Majorization for Nonconvex Loss with Applications to the Boosting Algorithm ⋮ Robust boosting with truncated loss functions ⋮ Delta Boosting Machine with Application to General Insurance ⋮ Boosting in the Presence of Outliers: Adaptive Classification With Nonconvex Loss Functions ⋮ Soft-max boosting ⋮ Data reduction in classification: A simulated annealing based projection method ⋮ A Learning Algorithm to Select Consistent Reactions to Human Movements ⋮ Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors) ⋮ Drifting games and Brownian motion

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