A Fast Way to Produce Optimal Fixed-Depth Decision Trees

By Alireza Farhangfar, R. Greiner, Martin A. Zinkevich. 2008

9 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. Cynthia Rudin
2. Lesia Semenova
3. Zhi Chen
4. Chudi Zhong
5. Elaine Angelino
6. Haiyang Huang
7. Daniel Alabi
8. Nicholas Larus-Stone

Citations in the corpus

• Interpretable Machine Learning: Fundamental Principles and 10 Grand Challenges (2021, background): “Efforts to fully optimize decision trees, solving problems related to (2), have been made since the 1990s (Bennett and Blue, 1996; Dobkin et al., 1996; Farhangfar et al., 2008; Nijssen and Fromont, 2007, 2010; Hu et al., 2019; Lin et al., 2020).”
• Learning Certifiably Optimal Rule Lists (2017, background): “The optimal decision tree problem is computationally hard, though since the late 1990’s, there has been research on building optimal decision trees using optimization techniques [2, 13, 14].”