Sciweavers

Share
CP
2009
Springer

Minimising Decision Tree Size as Combinatorial Optimisation

10 years 6 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justified as being consistent with the principle of Occam's Razor. Informally, this principle states that one should prefer the simpler hypothesis. In this paper we take this principle to the extreme. Specifically, we formulate decision tree induction as a combinatorial optimisation problem in which the objective is to minimise the number of nodes in the tree. We study alternative formulations based on satisfiability, constraint programming, and hybrids with integer linear programming. We empirically compare our approaches against standard induction algorithms, showing that the decision trees we obtain can sometimes be less than half the size of those found by other greedy methods. Furthermore, our decision trees are competitive in terms of accuracy on a variety of well-known benchmarks, often being the most acc...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull
Added 22 Nov 2009
Updated 22 Nov 2009
Type Conference
Year 2009
Where CP
Authors Christian Bessiere, Emmanuel Hebrard, Barry O'Sullivan
Comments (0)
books