Optimization and analysis of decision trees and rules: dynamic programming approach
From MaRDI portal
Recommendations
- Dynamic programming approach for partial decision rule optimization
- Dynamic programming approach to optimization of approximate decision rules
- Algorithms for optimal dyadic decision trees
- On Optimization of Decision Trees
- Sequential optimization of -decision rules relative to length, coverage and number of misclassifications
Cites work
- A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions
- Constructing optimal binary decision trees is NP-complete
- Dynamic programming approach to optimization of approximate decision rules
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- Optimal Binary Identification Procedures
- Optimizing decision trees through heuristically guided search
- Rough sets and Boolean reasoning
- The synthetic approach to decision table conversion
Cited in
(5)- Totally optimal decision rules
- Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions
- Dynamic programming approach to optimization of approximate decision rules
- Totally optimal decision trees for Boolean functions
- scientific article; zbMATH DE number 4047370 (Why is no real title available?)
This page was built for publication: Optimization and analysis of decision trees and rules: dynamic programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326154)
