Dynamic programming approach to optimization of approximate decision rules
From MaRDI portal
Recommendations
- Dynamic programming approach for partial decision rule optimization
- Optimization and analysis of decision trees and rules: dynamic programming approach
- Decision methods of dynamic programming equations
- Dynamic Programming and Decision Theory
- Approximation of dynamic programs
- Approximation of decision rules in stochastic programming
- scientific article; zbMATH DE number 7733443
- Perspectives of approximate dynamic programming
- scientific article; zbMATH DE number 3174053
Cited in
(15)- Relationships between length and coverage of decision rules
- Bi-criteria optimization problems for decision rules
- Approximate dynamic programming with a fuzzy parameterization
- Optimization and analysis of decision trees and rules: dynamic programming approach
- Sequential optimization of \(\gamma \)-decision rules relative to length, coverage and number of misclassifications
- Local attribute reductions for decision tables
- Classifiers based on optimal decision rules
- scientific article; zbMATH DE number 4047370 (Why is no real title available?)
- Dynamic programming approach for partial decision rule optimization
- Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results
- Application of dynamic programming approach to optimization of association rules relative to coverage and length
- Using dynamic programming to determine an optimal strategy in a contract bridge tournament
- Optimal scheduling for data transmission between mobile devices and cloud
- Dynamic programming approach for construction of association rule systems
- Heuristic-based feature selection for rough set approach
This page was built for publication: Dynamic programming approach to optimization of approximate decision rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2510537)
