bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition
From MaRDI portal
Publication:5060776
DOI10.1287/ijoc.2022.1225OpenAlexW4281632376MaRDI QIDQ5060776
Publication date: 11 January 2023
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.15263
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Learning optimal decision trees using constraint programming
- Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model
- Improving the precision of classification trees
- Constructing optimal binary decision trees is NP-complete
- Finding a short and accurate decision rule in disjunctive normal form by exhaustive search
- Learning decision trees with flexible constraints and objectives using integer optimization
- Very simple classification rules perform well on most commonly used datasets
- Oblique Multicategory Decision Trees Using Nonlinear Programming
- Optimal classification trees
