Comparison of Lazy Classification Algorithms Based on Deterministic and Inhibitory Decision Rules
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.
KeywordsRough sets Decision tables Deterministic decision rules Inhibitory decision rules
Unable to display preview. Download preview PDF.
- 3.Bazan, J.G.: A Comparison of Dynamic and Non-Dynamic Rough Set Methods for Extracting Laws from Decision Table. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery, pp. 321–365. Physica-Verlag, Heidelberg (1998)Google Scholar
- 4.Bazan, J.G.: Methods of Approximate Reasoning for Synthesis of Decision Algorithms. Ph.D. Thesis. Warsaw University (in Polish) (1998)Google Scholar
- 5.Data Mining Exploration System (Software), http://www.univ.rzeszow.pl/rspn
- 7.Moshkov, M., Skowron, A., Suraj, Z.: On Maximal Consistent Extensions of Information Systems. In: Conference Decision Support Systems (Zakopane, Poland, December 2006), University of Silesia, Katowice, vol. 1, pp. 199–206 (2007)Google Scholar
- 8.UCI Repository of Machine Learning Databases, University of California, Irvine http://www.ics.uci.edu/~mlearn/MLRepository.html
- 10.Nguyen, T.T.: Handwritten Digit Recognition Using Adaptive Classifier Construction Techniques. In: Pal, S.K., Polkowski, L., Skowron, A. (eds.) Rough-Neural Computing: Techniques for Computing with Words, pp. 573–585. Springer, Heidelberg (2003)Google Scholar
- 13.Rough Set Exploration System, http://logic.mimuw.edu.pl/~rsesGoogle Scholar