---
title: "Real Boosting a la Carte with an Application to Boosting Oblique Decision Tree"
authors:
  - "Claudia Henry"
  - "Richard Nock"
  - "Frank Nielsen"
doi: ""
url: "https://ijcai.org/proceedings/2007/135"
pdf: "https://ijcai.org/proceedings/2007/0135.pdf"
venue: "Proceedings of the Twentieth International Joint Conference on Artificial Intelligence"
year: 2007
pages: "842-846"
track: ""
keywords:
---

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

Claudia Henry, Richard Nock, Frank Nielsen

*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.
