Blanchard, G.G.BlanchardSchäfer, C.C.SchäferRozenholc, Y.Y.RozenholcMüller, K.-R.K.-R.Müller2022-03-032022-03-032007https://publica.fraunhofer.de/handle/publica/21312210.1007/s10994-007-0717-6We 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.en004006journal article