Optimization of decision rules based on dynamic programming approach

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

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


This chapter is devoted to the study of an extension of dynamic programming approach which allows optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure that is the difference between number of rows in a given decision table and the number of rows labeled with the most common decision for this table divided by the number of rows in the decision table. We fix a threshold γ, such that 0 ≤ γ < 1, and study so-called γ-decision rules (approximate decision rules) that localize rows in subtables which uncertainty is at most γ. Presented algorithm constructs a directed acyclic graph Δ γ T which nodes are subtables of the decision table T given by pairs "attribute = value". The algorithm finishes the partitioning of a subtable when its uncertainty is at most γ. The chapter contains also results of experiments with decision tables from UCI Machine Learning Repository. © 2014 Springer International Publishing Switzerland.
Original languageEnglish (US)
JournalStudies in Computational Intelligence
StatePublished - Jan 14 2014

ASJC Scopus subject areas

  • Artificial Intelligence


Dive into the research topics of 'Optimization of decision rules based on dynamic programming approach'. Together they form a unique fingerprint.

Cite this