Induction of shallow decision trees

How researchers see this paper

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

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].”
Learning customized and optimized lists of rules with mathematical programming (2018, background): “There is a (mostly older) body ofwork on optimality in decision trees using dynamic programming [7,18,19,50].”
Scalable Bayesian Rule Lists (2016, background): “There are a series of works from the mid-1990’s onwards on finding optimal decision trees using dynamic programming and search techniques (e.g., Bennett & Blue, 1996; Auer et al., 1995; Dobkin et al., 1996; Boros et al., 2000; Garofalakis et al., 2000; Farhangfar et al., 2008), mainly working with f”