A Simpler Analysis of the Multi-way Branching Decision Tree Boosting Algorithm,

Author: Kohei Hatano .

Source: Lecture Notes in Artificial Intelligence Vol. 2225, 2001, 77 - 91.

Abstract. 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 much simpler 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.

©Copyright 2001 Springer