A simple boosting algorithm using multi-way branching decision trees

研究成果: Contribution to journalArticle

抜粋

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.

元の言語英語
ページ(範囲)503-518
ページ数16
ジャーナルTheory of Computing Systems
37
発行部数4
DOI
出版物ステータス出版済み - 7 2004
外部発表Yes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computational Theory and Mathematics

フィンガープリント A simple boosting algorithm using multi-way branching decision trees' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用