An empirical comparison of rule sets induced by LERS and probabilistic rough classification

7Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we present results of an experimental comparison (in terms of an error rate) of rule sets induced by the LERS data mining system with rule sets induced using the probabilistic rough classification (PRC). As follows from our experiments, the performance of LERS (possible rules) is significantly better than the best rule sets induced by PRC with any threshold (two-tailed test, 5% significance level). Additionally, the LERS possible rule approach to rule induction is significantly better than the LERS certain rule approach (two-tailed test, 5% significance level). © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Grzymala-Busse, J. W., Marepally, S. R., & Yao, Y. (2010). An empirical comparison of rule sets induced by LERS and probabilistic rough classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6086 LNAI, pp. 590–599). https://doi.org/10.1007/978-3-642-13529-3_63

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free