Further results on the margin explanation of boosting: new algorithm and experiments

DOI10.1007/s11432-012-4602-yzbMath1245.68162OpenAlexW2054697721WikidataQ68475836 ScholiaQ68475836MaRDI QIDQ439827

Liwei Wang, Jufu Feng, Xiaocheng Deng, Zhaoxiang Jing

Publication date: 17 August 2012

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-012-4602-y

zbMATH Keywords

boostingmarginEmargin theory

Mathematics Subject Classification ID

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

Uses Software

• UCI-ml
• AdaBoost.MH

Cites Work

• Unnamed Item
• A decision-theoretic generalization of on-line learning and an application to boosting
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Empirical margin distributions and bounding the generalization error of combined classifiers
• Process consistency for AdaBoost.
• On the Bayes-risk consistency of regularized boosting methods.
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Complexities of convex combinations and bounding the generalization error in classification
• Convexity, Classification, and Risk Bounds
• Linear programming boosting via column generation

This page was built for publication: Further results on the margin explanation of boosting: new algorithm and experiments