@inbook{3b4c5c546b8b4e4cbf7435aaf61b2b0b,

title = "Minimal inhibitory association rules for almost all k -valued information systems",

abstract = "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].",

author = "Pawel Delimata and Moshkov, {Mikhail Ju} and Andrzej Skowron and Zbigniew Suraj",

year = "2009",

doi = "10.1007/978-3-540-85638-2_3",

language = "English (US)",

isbn = "9783540856375",

series = "Studies in Computational Intelligence",

pages = "31--41",

editor = "Pawel Delimata and Zbigniew Suraj and Mikhail Moshkov and Andrzej Skowron",

booktitle = "Inhibitory Rules in Data Analysis",

}