Optimal dyadic decision trees

G. Blanchard, C. Schäfer, Y. Rozenholc, Klaus Muller

Research output: Contribution to journalArticle

24 Citations (Scopus)


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
Issue number2-3
Publication statusPublished - 2007 Mar 1
Externally publishedYes



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

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Artificial Intelligence

Cite this

Blanchard, G., Schäfer, C., Rozenholc, Y., & Muller, K. (2007). Optimal dyadic decision trees. Machine Learning, 66(2-3), 209-241. https://doi.org/10.1007/s10994-007-0717-6