Global Tree Optimization: A Non-greedy Decision Tree Algorithm

By Kristin P. Bennett. 2007

84 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Mohammad Norouzi
2. Liang-Chieh Chen
3. Kaiming He
4. David J. Fleet
5. Sergey Levine
6. Jingdong Wang
7. Luc Van Gool
8. Pushmeet Kohli

Citations in the corpus

• Learning Optimal Decision Trees with MaxSAT and its Integration in AdaBoost (2020, neutral): “∗Corresponding author methods might exist [Bennett, 1994].”
• Efficient Non-greedy Optimization of Decision Trees (2015, methodology): “Bennett [1] proposes a non-greedy multi-linear programming based approach for global tree optimization and shows that the method produces trees that have higher classification accuracy than standard greedy trees.”
• An Optimal Constrained Pruning Strategy for Decision Trees (2009, background): “Also, Bennett (1994) has studied how splitting decisions should be made at each level of a given particular final tree structure so that the resultant classification error with respect to two classes of data points would be minimized.”