bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition
From MaRDI portal
Bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition
Recommendations
- scientific article; zbMATH DE number 1140610
- A branch \& bound algorithm to determine optimal cross-splits for decision tree induction
- Decision tree induction based on efficient tree restructuring
- scientific article; zbMATH DE number 2087937
- Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction
Cites work
- A Bayesian framework for learning rule sets for interpretable classification
- Constructing optimal binary decision trees is NP-complete
- Finding a short and accurate decision rule in disjunctive normal form by exhaustive search
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- Improving the precision of classification trees
- Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model
- Learning decision trees with flexible constraints and objectives using integer optimization
- Learning optimal decision trees using constraint programming
- Oblique multicategory decision trees using nonlinear programming
- Optimal classification trees
- Very simple classification rules perform well on most commonly used datasets
Cited in
(4)
This page was built for publication: bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060776)
