Faculty of Informatics and Statistics, Department of Information and Knowledge Engineering (DIKE)

Date and time: October 20 2005 (10:30 – 12:00).

Room: 403 NB


Finding Optimal Decision Tree Structure


  • Petr Máša, KIZI, VŠE Praha

The same description of data structure can be described by many decision trees. For example, when splitting leaf to two new leaves with same proportion of target variable. The goal is to find the smallest decision tree which describe data (=optimal tree). This can be done under some assumptions with proposed algorithm. Finding optimal decision tree is core of prepared thesis. Basic idea of the problem, basic idea of the algorithm, some key theorems proved and some results so far will be shown.

Downloads: slides 1 

Powered by Resource Description Framework (RDF)