An Empirical Comparison of Rule Sets Induced by LERS and Probabilistic Rough Classification

  • Jerzy W. Grzymala-Busse
  • Shantan R. Marepally
  • Yiyu Yao
Conference paper

DOI: 10.1007/978-3-642-13529-3_63

Volume 6086 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Grzymala-Busse J.W., Marepally S.R., Yao Y. (2010) An Empirical Comparison of Rule Sets Induced by LERS and Probabilistic Rough Classification. In: Szczuka M., Kryszkiewicz M., Ramanna S., Jensen R., Hu Q. (eds) Rough Sets and Current Trends in Computing. RSCTC 2010. Lecture Notes in Computer Science, vol 6086. Springer, Berlin, Heidelberg

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).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jerzy W. Grzymala-Busse
    • 1
    • 2
  • Shantan R. Marepally
    • 1
  • Yiyu Yao
    • 3
  1. 1.Department of Electrical Engineering and Computer ScienceUniversity of KansasLawrenceUSA
  2. 2.Institute of Computer SciencePolish Academy of SciencesWarsawPoland
  3. 3.Department of Computer ScienceUniversity of ReginaReginaCanada