Prescreening of candidate rules using association rule mining and Pareto-optimality in genetic rule selection

Genetic rule selection is an approach to the design of classifiers with high accuracy and high interpretability. It searches for a small number of simple classification rules from a large number of candidate rules. The effectiveness of genetic rule selection strongly depends on the choice of candidate rules. If we have hundreds of thousands of candidate rules, it is very difficult to efficiently search for their good subsets. On the other hand, if we have only a few candidate rules, rule selection does not make sense. In this paper, we examine the use of Pareto-optimal and near Pareto-optimal rules with respect to support and confidence as candidate rules in genetic rule selection.