Building Decision Trees with Constraints
By Minos N. Garofalakis, Dongjoon Hyun, Rajeev Rastogi, Kyuseok Shim. 2003
55 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Cynthia Rudin
- Margo I. Seltzer
- Chudi Zhong
- Siegfried Nijssen
- Jimmy J. Lin
- Diane Hu
- Élisa Fromont
- Tong Wang
In Computational Theory and Mathematics
- Cynthia Rudin
- Margo I. Seltzer
- Siegfried Nijssen
- Chudi Zhong
- Jimmy J. Lin
- Diane Hu
- Élisa Fromont
- Ş. Ertekin
In Information Systems
- Cynthia Rudin
- Margo I. Seltzer
- Chudi Zhong
- Siegfried Nijssen
- Jimmy J. Lin
- Diane Hu
- Élisa Fromont
- Ş. Ertekin
Citations in the corpus
- Generalized and Scalable Optimal Sparse Decision Trees (2020, methodology): “5 (Nijssen et al., 2020), BinOCT (Verwer & Zhang, 2019), DTC (Garofalakis et al., 2003), and CART (Breiman et al., 1984).”
- Mining optimal decision trees from itemset lattices (2007, methodology): “More recently, pruning strategies of decision trees have been studied [10].”
- Optimal constraint-based decision tree induction from itemset lattices (2010, unknown): “More recently, pruning strategies of decision trees have been studied by Garofalakis et al. (2003).”