Real Boosting a la Carte with an Application to Boosting Oblique Decision Tree
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.
@inproceedings{ijcai2007p135,
title = {Real Boosting a la Carte with an Application to Boosting Oblique Decision Tree},
author = {Henry, Claudia and Nock, Richard and Nielsen, Frank},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {842--846},
year = {2007},
url = {https://ijcai.org/proceedings/2007/135},
}
TY - CPAPER TI - Real Boosting a la Carte with an Application to Boosting Oblique Decision Tree AU - Henry, Claudia AU - Nock, Richard AU - Nielsen, Frank T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 842 EP - 846 UR - https://ijcai.org/proceedings/2007/135 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: