Advertisement

On the Best Search Method in the LEM1 and LEM2 Algorithms

  • Jerzy W. Grzymala-Busse
  • Paolo Werbrouck
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 13)

Abstract

This report presents results of experiments on two algorithms of machine learning: LEM1 and LEM2. Both algorithms belong to the LEM (Learning from Examples Module) family developed at the Department of Computer Science, University of Kansas.

For LEM1, two different approaches to test attribute dependence were compared: partition and lower boundaries. The two different versions of the algorithm were developed and their run times on a set of test files were compared.

For LEM2 a number of experiments were made to find the best search method of the description space. Some heuristics used within the algorithm to pick the “best” attribute-value pairs for the generation of rules were selected and tested. The quality of different methods has been compared on the basis of the total number of conditions, the total number of rules, and the average length of rules.

Keywords

Lower Boundary Maximum Intersection Production Rule Decision Table Approximation Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Budihardjo, J. W. Grzymala-Busse, An overview of the learning program LERS_LB 2.5. Report TR-90–4, Department of Computer Science, University of Kansas, 1990Google Scholar
  2. [2]
    C.- C. Chan, J. W. Grzymala-Busse, Rough-set boundaries as a tool for learning rules from examples. Proc. of the ISMIS-89, 4th International Symposium on Methodologies for Intelligent Systems, Charlotte, North Carolina, October 12–14, 1989, 281–288Google Scholar
  3. [3]
    C.- C. Chan, J. W. Grzymala-Busse, On the Attribute Redundancy and the Learning Programs ID3, PRISM, and LEM2. Report TR-91–14, Department of Computer Science, University of Kansas, 1991Google Scholar
  4. [4]
    J. W. Grzymala-Busse, L. Yue, The Machine Learning Programs LEM2 and LERS_LB2 based on Single Coverings and Blocks. Report TR-90–3, Department of Computer Science, University of Kansas, 1990Google Scholar
  5. [5]
    R. S. Michalski, A theory and methodology of inductive learning, In Machine Learning. R. S. Michalski, J. G. Carbonell, T. M. Mitchell (eds), Tioga Publ. Co. 1983Google Scholar
  6. [6]
    Z. Pawlak, Rough sets. Basic notions, Institute Comp. Sci. Polish Academy Sci. Rep. #431, Warsaw, 1981Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Jerzy W. Grzymala-Busse
    • 1
  • Paolo Werbrouck
    • 1
  1. 1.Department of Electrical Engineering and Computer ScienceUniversity of KansasLawrenceUSA

Personalised recommendations