{"type":"ScholarlyArticle","title":"Real Boosting a la Carte with an Application to Boosting Oblique Decision Tree","authors":[{"name":"Claudia Henry","slug":"claudia-henry","given":"Claudia","family":"Henry","affiliation":""},{"name":"Richard Nock","slug":"richard-nock","given":"Richard","family":"Nock","affiliation":""},{"name":"Frank Nielsen","slug":"frank-nielsen","given":"Frank","family":"Nielsen","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2007/135","pdf":"https://ijcai.org/proceedings/2007/0135.pdf","markdown":"https://ijcai.org/proceedings/2007/135.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/135","volume":{"slug":"2007","title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2007","url":"https://ijcai.org/proceedings/2007/","year":2007,"location":"Hyderabad, India","dates":"","editors":"Ramon López de Mántaras","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":135,"pages":{"first":842,"last":846},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}