A simple boosting algorithm using multi-way branching decision trees

Research output: Contribution to journalArticlepeer-review


We improve the analysis of the decision tree boosting algorithm proposed by Mansour and McAllester. For binary classification problems, the algorithm of Mansour and McAllester constructs a multi-way branching decision tree using a set of multi-class hypotheses. Mansour and McAllester proved that it works under certain conditions. We give a rigorous analysis of the algorithm and simplify the conditions. From this simplification, we can provide a simpler algorithm, for which no prior knowledge on the quality of weak hypotheses is necessary.

Original languageEnglish
Pages (from-to)503-518
Number of pages16
JournalTheory of Computing Systems
Issue number4
Publication statusPublished - Jul 2004
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'A simple boosting algorithm using multi-way branching decision trees'. Together they form a unique fingerprint.

Cite this