Dynamic programming approach to optimization of approximate decision rules

DOI10.1016/j.ins.2012.09.018zbMath1293.68265OpenAlexW2018472001MaRDI QIDQ2510537

Igor Chikalov, Beata Zielosko, Talha Amin, Mikhail Ju. Moshkov

Publication date: 1 August 2014

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2012.09.018

zbMATH Keywords

dynamic programminglengthcoverageapproximate decision rules

Mathematics Subject Classification ID

Dynamic programming (90C39) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (6)

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 ⋮ Heuristic-based feature selection for rough set approach ⋮ Bi-criteria optimization problems for decision rules ⋮ Optimal scheduling for data transmission between mobile devices and cloud ⋮ Local attribute reductions for decision tables

Uses Software

• UCI-ml
• ENDER

This page was built for publication: Dynamic programming approach to optimization of approximate decision rules