Minimal Inhibitory Association Rules for Almost All k-Valued Information Systems

Part of the Studies in Computational Intelligence book series (SCI, volume 163)


There are three approaches to use inhibitory rules in classifiers: (i) lazy algorithms based on an information about the set of all inhibitory rules, (ii) standard classifiers based on a subset of inhibitory rules constructed by a heuristic, and (iii) standard classifiers based on the set of all minimal (irreducible) inhibitory rules. The aim of this chapter is to show that the last approach is not feasible (from computational complexity point of view).

We restrict our considerations to the class of k-valued information systems, i.e., information systems with attributes having values from {0,...,k − 1}, where k ≥ 2. Note that the case k = 2 was considered earlier in [51].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.University of RzeszowPoland
  2. 2.University of Silesia, SosnowiecPoland
  3. 3.Warsaw University, WarsawPoland

Personalised recommendations