Optimization of approximate inhibitory rules relative to number of misclassifications

Abstract

In this work, we consider so-called nonredundant inhibitory rules, containing an expression "attribute≠ value" on the right-hand side, for which the number of misclassifications is at most a threshold y. We study a dynamic programming approach for description of the considered set of rules. This approach allows also the optimization of nonredundant inhibitory rules relative to the length and coverage [1, 2]. The aim of this paper is to investigate an additional possibility of optimization relative to the number of misclassifications. The results of experiments with decision tables from the UCI Machine Learning Repository [3] show this additional optimization achieves a fewer misclassifications. Thus, the proposed optimization procedure is promising.