@INPROCEEDINGS { Rsds4443,
author = {Delimata, Pawel and Moshkov, Mikhail and Skowron, Andrzej and Suraj, Zbigniew}, 
title = {Lazy Classification Algorithms Based on Deterministic and Inhibitory Rules}, 
booktitle = {Proceedings of 12 th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU'2008)}, 
pages = {1773--1778}, 
publisher = {IEEE}, 
month = {June}, 
year = 2008, 
editor = {Magdalena, Luis and Ojeda-Aciego, Manuel and Verdegay, Jose Luis}, 
abstract = {In the paper, two families of lazy classification algorithms of polynomial time complexity are considered. These algorithms are based on deterministic (with a relation "attribute = value" on the right hand side) and inhibitory (with a relation "attribute ? value" on the right hand side) rules, but the direct generation of rules is not required. Instead of this, the considered algorithms extract efficiently for a new object some information about the set of rules which is next used by a decision-making procedure. Results of experiments show that the performance of algorithms based on inhibitory rules is in many cases better than the performance of algorithms based on deterministic rules.}, 
keywords = {rough sets, decision tables, information systems, deterministic rules, inhibitory rules, }, 
}