Optimal Generalized Decision Trees via Integer Programming
This topic contains 0 replies, has 1 voice, and was last updated by arXiv 11 months ago.

Optimal Generalized Decision Trees via Integer Programming
Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if allowed to grow large, they lose interpretability. In this paper, we present a novel mixed integer programming formulation to construct optimal decision trees of specified size. We take special structure of categorical features into account and allow combinatorial decisions (based on subsets of values of such a feature) at each node. We show that very good accuracy can be achieved with small trees using moderatelysized training sets. The optimization problems we solve are easily tractable with modern solvers.
Optimal Generalized Decision Trees via Integer Programming
by Oktay Gunluk, Jayant Kalagnanam, Matt Menickelly, Katya Scheinberg
https://arxiv.org/pdf/1612.03225v2.pdf
You must be logged in to reply to this topic.