Decision tree reduction

By J. Cockett, J. A. Herrera. 1990

How researchers see this paper

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

1. Alexey Ignatiev
2. Nina Narodytska
3. Joao Marques-Silva
4. Sreerama K. Murthy
5. Filipe Pereira
6. Neil C. Berkman
7. J. Clouse
8. David Madigan

Citations in the corpus

• Learning Optimal Decision Trees with SAT (2018, background): “Decision trees have been actively investigated since the early 80s [Breiman et al. , 1984; Quinlan, 1986; Quinlan, 1993; Mitchell, 1997; Cockett and Hierrera, 1990], and find important practical applications in a wide range of domains, including ML and DM [Quinlan, 1993; Murthy, 1998; Rokach and…”
• Efficient sequential decision‐making algorithms for container inspection operations (2011, background): “Please see [12] for details of the algorithm.”
• Decision Tree Induction Based on Efficient Tree Restructuring (1997, background): “Cockett and Herrera (1990) present an algebraic approach to finding irreducible trees.”
• Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey (1998, methodology): “Tree reduction: Cockett and Herrera [61] suggested a method to reduce an arbitrary binary decision tree to an \irreducible" form, using discrete decision theory principles.”