Inclusive pruning: A new class of pruning rule for unordered search and its application to classification learning.

Geoff Webb
School of Computing and Mathematics, Deakin University, Geelong, 3217, Australia.


This paper presents a new class of pruning rule for unordered search. Previous pruning rules for unordered search identify operators that should not be applied in order to prune nodes reached via those operators. In contrast, the new pruning rules identify operators that should be applied and prune nodes that are not reached via those operators. Specific pruning rules employing both these approaches are identified for classification learning. Experimental results demonstrate that application of the new pruning rules can reduce by more than 60\% the number of states from the search space that are considered during classification learning.
Conference Home Page