Boosting using branching programs

DOI10.1006/JCSS.2001.1796zbMath1006.68110OpenAlexW2003866851MaRDI QIDQ1604220

Yishay Mansour, David Allen McAllester

Publication date: 4 July 2002

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.2001.1796

zbMATH Keywords

branching programs

Mathematics Subject Classification ID

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

Related Items (5)

On domain-partitioning induction criteria: worst-case bounds for the worst-case based ⋮ Impact of Contamination on Training and Test Error Rates in Statistical Clustering ⋮ Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor ⋮ Boosting in the presence of noise ⋮ Top-down decision tree learning as information based boosting

Uses Software

• AdaBoost.MH

Cites Work

• Boosting a weak learning algorithm by majority
• Unnamed Item

This page was built for publication: Boosting using branching programs