Classification Algorithms Based on Template's Decision Rules

In the paper, classification algorithms are presented. These algorithms are based on nondeterministic decision rules that are called template’s decision rules. The conditional part of these rules is a template and the decision part is satisfactorily small set of decisions. Only rules with suficiently large support are used. The proposed classification algorithms were tested on the group of decision tables from the UCI Machine Learning Repository. Results of experiments show that the classification algorithms based on template’s decision rules are often better than the algorithms based on deterministic decision rules.

[1]  Sadaaki Miyamoto,et al.  Rough Sets and Current Trends in Computing , 2012, Lecture Notes in Computer Science.

[2]  Barbara Marszal-Paszek,et al.  Minimal Templates and Knowledge Discovery , 2007, RSEISP.

[3]  Andrzej Skowron,et al.  Rough sets and concurrency , 1993 .

[4]  J. Kacprzyk,et al.  Advances in the Dempster-Shafer theory of evidence , 1994 .

[5]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[6]  Andrzej Skowron,et al.  From the Rough Set Theory to the Evidence Theory , 1991 .

[7]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[8]  Arkadiusz Wojna,et al.  On the Evolution of Rough Set Exploration System , 2004, Rough Sets and Current Trends in Computing.

[9]  Arthur P. Dempster,et al.  Upper and Lower Probabilities Induced by a Multivalued Mapping , 1967, Classic Works of the Dempster-Shafer Theory of Belief Functions.