Oracle Bounds and Exact Algorithm for Dyadic Classification Trees

Gilles Blanchard, Christin Schäfer, Yves RozenholcCOLT 2004 · OpenReview

Abstract

This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is based on model selection by penalized empirical loss minimization. Our work consists in two complementary parts: first, a theoretical analysis of the method leads to deriving oracle-type inequalities for three different possible loss functions. Secondly, we present an algorithm able to compute the estimator in an exact way.
BibTeX
@inproceedings{blanchard2004oracle,
  author = {Gilles Blanchard and Christin Schäfer and Yves Rozenholc},
  title = {{Oracle Bounds and Exact Algorithm for Dyadic Classification Trees}},
  booktitle = {Conference on Learning Theory},
  year = {2004},
  url = {https://openreview.net/forum?id=btiXbU3778g},
}

Loading related content...

Figure