Proceedings

Real Boosting a la Carte with an Application to Boosting Oblique Decision Tree

Download BibTeX Cite

Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 842-846.

Abstract

In the past ten years, boosting has become a major field of machine learning and classification. This paper brings contributions to its theory and algorithms. We first unify a well-known top-down decision tree induction algorithm due to Kearns and Mansour, and discrete AdaBoost, as two versions of a same higher-level boosting algorithm. It may be used as the basic building block to devise simple provable boosting algorithms for complex classifiers. We provide one example: the first boosting algorithm for Oblique Decision Trees, an algorithm which turns out to be simpler, faster and significantly more accurate than previous approaches.

Claudia Henry, Richard Nock, and Frank Nielsen. 2007. Real Boosting a la Carte with an Application to Boosting Oblique Decision Tree. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07. IJCAI, 842–846. https://ijcai.org/proceedings/2007/135
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards