Bi-criteria optimization problems for decision rules |
| |
Authors: | Fawaz Alsolami Talha Amin Igor Chikalov Mikhail Moshkov |
| |
Institution: | 1.Computer Science Department,King Abdulaziz University,Jeddah,Saudi Arabia;2.Computer, Electrical and Mathematical Sciences and Engineering Division,King Abdullah University of Science and Technology,Thuwal,Saudi Arabia |
| |
Abstract: | We consider bi-criteria optimization problems for decision rules and rule systems relative to length and coverage. We study decision tables with many-valued decisions in which each row is associated with a set of decisions as well as single-valued decisions where each row has a single decision. Short rules are more understandable; rules covering more rows are more general. Both of these problems—minimization of length and maximization of coverage of rules are NP-hard. We create dynamic programming algorithms which can find the minimum length and the maximum coverage of rules, and can construct the set of Pareto optimal points for the corresponding bi-criteria optimization problem. This approach is applicable for medium-sized decision tables. However, the considered approach allows us to evaluate the quality of various heuristics for decision rule construction which are applicable for relatively big datasets. We can evaluate these heuristics from the point of view of (i) single-criterion—we can compare the length or coverage of rules constructed by heuristics; and (ii) bi-criteria—we can measure the distance of a point (length, coverage) corresponding to a heuristic from the set of Pareto optimal points. The presented results show that the best heuristics from the point of view of bi-criteria optimization are not always the best ones from the point of view of single-criterion optimization. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|