Minimal inhibitory association rules for almost all k -valued information systems

Pawel Delimata, Mikhail Ju Moshkov, Andrzej Skowron, Zbigniew Suraj

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


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]. © 2009 Springer-Verlag Berlin Heidelberg.
Original languageEnglish (US)
Pages (from-to)31-41
Number of pages11
JournalStudies in Computational Intelligence
StatePublished - Jan 1 2009
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-09-21

ASJC Scopus subject areas

  • Artificial Intelligence


Dive into the research topics of 'Minimal inhibitory association rules for almost all k -valued information systems'. Together they form a unique fingerprint.

Cite this