The optimal trees were found using a novel graph coloring idea. We summarize the main observations from our experiments below. Where relevant, we briefly mention related work in the literature. The expected depth of greedily induced decision trees was consistently very close to the optimal. Garey, M. R., and Graham, R. L. 1974.
Performance bounds on the splitting algorithm for binary testing .
Improving upon greedy induction Most tree induction systems use a greedy approach trees are induced top down, a node at a time. The problem of inducing globally optimal decision trees has been addressed time and again. Performance bounds on the splitting algorithm for binary testing . No context found. Michael R. Garey and Ronald L. Graham.