Comparison of some classification algorithms based on deterministic and nondeterministic decision rules

  • Authors:

  • Paweł Delimata;Barbara Marszał-Paszek;Mikhail Moshkov;Piotr Paszek;Andrzej Skowron;Zbigniew Suraj

  • Affiliations:

  • University of Rzeszów, Rzeszów, Poland;Institute of Computer Science, University of Silesia, Sosnowiec, Poland;Division of Mathematical and Computer Sciences and Engineering, King Abdullah University of Science and Technology, Jeddah, Saudi Arabia;Institute of Computer Science, University of Silesia, Sosnowiec, Poland;Institute of Mathematics, Warsaw University, Warsaw, Poland;University of Rzeszów, Rzeszów, Poland

  • Venue:
  • Transactions on rough sets XII
  • Year:
  • 2010

Quantified Score

Hi-index 0.02

Visualization

Abstract

We discuss two, in a sense extreme, kinds of nondeterministic rules in decision tables. The first kind of rules, called as inhibitory rules, are blocking only one decision value (i.e., they have all but one decisions from all possible decisions on their right hand sides). Contrary to this, any rule of the second kind, called as a bounded nondeterministic rule, can have on the right hand side only a few decisions. We show that both kinds of rules can be used for improving the quality of classification. In the paper, two lazy classification algorithms of polynomial time complexity are considered. These algorithms are based on deterministic and inhibitory decision rules, but the direct generation of rules is not required. Instead of this, for any new object the considered algorithms extract from a given decision table efficiently some information about the set of rules. Next, this information is used by a decision-making procedure. The reported results of experiments show that the algorithms based on inhibitory decision rules are often better than those based on deterministic decision rules. We also present an application of bounded nondeterministic rules in construction of rule based classifiers. We include the results of experiments showing that by combining rule based classifiers based on minimal decision rules with bounded nondeterministic rules having confidence close to 1 and sufficiently large support, it is possible to improve the classification quality.