Dynamic programming approach for partial decision rule optimization
From MaRDI portal
Recommendations
- Dynamic programming approach to optimization of approximate decision rules
- Sequential optimization of -decision rules relative to length, coverage and number of misclassifications
- Bi-criteria optimization problems for decision rules
- Application of dynamic programming approach to optimization of association rules relative to coverage and length
- Relationships between length and coverage of decision rules
Cited in
(8)- Dynamic programming approach to optimization of approximate decision rules
- Classifiers based on optimal decision rules
- Sequential optimization of -decision rules relative to length, coverage and number of misclassifications
- scientific article; zbMATH DE number 4047370 (Why is no real title available?)
- Dynamic programming approach for construction of association rule systems
- Application of dynamic programming approach to optimization of association rules relative to coverage and length
- Optimization and analysis of decision trees and rules: dynamic programming approach
- Relationships between length and coverage of decision rules
This page was built for publication: Dynamic programming approach for partial decision rule optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3168190)