Optimal dyadic decision trees

G. Blanchard, C. Schäfer, Y. Rozenholc, K. R. Müller

Research output: Contribution to journalArticlepeer-review

24 Citations (Scopus)

Abstract

We introduce a new algorithm building an optimal dyadic decision tree (ODT). The method combines guaranteed performance in the learning theoretical sense and optimal search from the algorithmic point of view. Furthermore it inherits the explanatory power of tree approaches, while improving performance over classical approaches such as CART/C4.5, as shown on experiments on artificial and benchmark data.

Original languageEnglish
Pages (from-to)209-241
Number of pages33
JournalMachine Learning
Volume66
Issue number2-3
DOIs
Publication statusPublished - 2007 Mar

Keywords

  • Adaptive convergence rate
  • Classification
  • Decision tree
  • Density estimation
  • Oracle inequality

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Optimal dyadic decision trees'. Together they form a unique fingerprint.

Cite this