Two Families of Classification Algorithms

Authors:
Pawel Delimata;Mikhail Moshkov;Andrzej Skowron;Zbigniew Suraj
Affiliations:
Chair of Computer Science, University of Rzeszów, Rejtana 16A, 35-310 Rzeszów, Poland;Institute of Computer Science, University of Silesia, Bedzińska 39, 41-200 Sosnowiec, Poland;Institute of Mathematics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland;Chair of Computer Science, University of Rzeszów, Rejtana 16A, 35-310 Rzeszów, Poland and Institute of Computer Science, State School of Higher Education in Jarosław, Czarnieckiego ...
Venue:
RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Year:
2009

Citing 3
Cited 6

Lazy learning

Lazy learning
Discovery of Decision Rules by Matching New Objects Against Data Tables

RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Analogy-based reasoning in classifier construction

Transactions on Rough Sets IV

Maximal consistent extensions of information systems relative to their theories

Information Sciences: an International Journal
On Minimal Inhibitory Rules for Almost All k-Valued Information Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Comparison of some classification algorithms based on deterministic and nondeterministic decision rules

Transactions on rough sets XII
On Minimal Inhibitory Rules for Almost All k-Valued Information Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Optimization of inhibitory decision rules relative to length and coverage

RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Length and coverage of inhibitory decision rules

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, two families of lazy classification algorithms of polynomial time complexity are considered. These algorithms are based on ordinary and inhibitory rules, but the direct generation of rules is not required. Instead of this, the considered algorithms extract efficiently for a new object some information on the set of rules which is next used by a decision-making procedure.