Dynamic programming approach to optimization of approximate decision rules
This paper is devoted to the study of an extension of dynamic programming approach which allows sequential optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure R(T) which is the number of unordered pairs of rows with different decisions in the decision table T. For a nonnegative real number ?, we consider ?-decision rules that localize rows in subtables of T with uncertainty at most ?. Our algorithm constructs a directed acyclic graph ??(T) which nodes are subtables of the decision table T given by systems of equations of the kind attribute=value. This algorithm finishes the partitioning of a subtable when its uncertainty is at most ?. The graph ??(T) allows us to describe the whole set of so-called irredundant ?-decision rules. We can describe all irredundant ?-decision rules with minimum length, and after that among these rules describe all rules with maximum coverage. We can also change the order of optimization. The consideration of irredundant rules only does not change the results of optimization. This paper contains also results of experiments with decision tables from UCI Machine Learning Repository.
dynamic programming approximate decision rules length coverage