Finding a short and accurate decision rule in disjunctive normal form by exhaustive search
Machine Learning , Volume 80 - Issue 1 p. 33- 62
Greedy approaches suffer from a restricted search space which could lead to suboptimal classifiers in terms of performance and classifier size. This study discusses exhaustive search as an alternative to greedy search for learning short and accurate decision rules. The Exhaustive Procedure for LOgic-Rule Extraction (EXPLORE) algorithm is presented, to induce decision rules in disjunctive normal form (DNF) in a systematic and efficient manner. We propose a method based on subsumption to reduce the number of values considered for instantiation in the literals, by taking into account the relational operator without loss of performance. Furthermore, we describe a branch-and-bound approach that makes optimal use of user-defined performance constraints. To improve the generalizability we use a validation set to determine the optimal length of the DNF rule. The performance and size of the DNF rules induced by EXPLORE are compared to those of eight well-known rule learners. Our results show that an exhaustive approach to rule learning in DNF results in significantly smaller classifiers than those of the other rule learners, while securing comparable or even better performance. Clearly, exhaustive search is computer-intensive and may not always be feasible. Nevertheless, based on this study, we believe that exhaustive search should be considered an alternative for greedy search in many problems.
|, , ,|
|Organisation||Erasmus MC: University Medical Center Rotterdam|
Rijnbeek, P.R, & Kors, J.A. (2010). Finding a short and accurate decision rule in disjunctive normal form by exhaustive search. Machine Learning, 80(1), 33–62. doi:10.1007/s10994-010-5168-9