Summary
The MLEM2 algorithm is a rule induction algorithm in which rule induction, discretization, and handling missing attribute values are all conducted simultaneously. In this paper two versions of the MLEM2 algorithm are compared: the first version of MLEM2 induces rules that may contain two conditions with the same numerical attribute and different intervals. The second version of MLEM2 induces rules with merged conditions associated with numerical attributes, i.e., all conditions are related to different attributes. For completeness, experiments on the original LEM algorithm with discretization as a preprocessing are also included. The performance, in terms of accuracy, for all three algorithms is approximately the same (for any two of them the difference in performance is not statistically significant).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Booker LB, Goldberg DE, and Holland JF (1990) Classifier systems and genetic algorithms. In: Carbonell JG (ed.) Machine learning. Paradigms and methods. MIT, Menlo Park, CA, 235–282
Chmielewski MR, Grzymala-Busse JW (1996) Global discretization of continuous attributes as preprocessing for machine learning, International Journal of Approximate Reasoning 15: 319–331
Fayyad UM, Irani KB (1992) On the handling of continuous-valued attributes in decision tree generation, Machine Learning 8: 87–102
Grzymala-Busse JW (1992) LERS – A system for learning from examples based on rough sets. In: Slowinski R (ed) Intelligent decision support. Handbook of applications and advances of the rough set theory. Kluwer, Dordrecht, 3–18
Grzymala-Busse JW (1997) A new version of the rule induction system LERS, Fundamenta Informaticae 31: 27–39
Grzymala-Busse JW (2002) Discretization of numerical attributes. In: Kloesgen W, Zytkow J (eds) Handbook of data mining and knowledge discovery, Oxford University Press, New York, 218–225
Grzymala-Busse JW (2002) MLEM2: A new algorithm for rule induction from imperfect data. Proceedings of the 9th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2002, July 1–5, Annecy, France, 243–250
Grzymala-Busse JW (2004) Three strategies to rule induction from data with numerical attributes, Transactions on Rough Sets, Lecture Notes in Computer Science Journal Subline, Springer, Berlin Heidelberg New York 2: 54–62
Grzymala-Busse JW, Stefanowski J (2001) Three discretization methods for rule induction, International Journal of Intelligent Systems 16: 29–38
Grzymala-Busse JW, Hsiao TY (1998) Dropping conditions in rules induced by ID3. Proceedings of the 6th International Workshop on Rough Sets, Data Mining and Granular Computing RSDMGrC’98 at the 4th Joint Conference on Information Sciences (JCIS’98), October 1998, Research Triangle Park, NC, 351–354
Hamburg M (1983) Statistical Analysis for Decision Making. Harcourt Brace Jovanovich, New York 546–550 and 721
Holland JH, Holyoak KJ, Nisbett RE (1986) Induction. Processes of inference, learning, and discovery. MIT, Boston
Pawlak Z (1982) Rough sets, International Journal of Computer and Information Sciences 11: 341–356
Pawlak Z (1991) Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer, Dordrecht
Quinlan JR (1993) C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco, CA
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Grzymala-Busse, J.W. (2008). MLEM2 Rule Induction Algorithms: With and Without Merging Intervals. In: Lin, T.Y., Xie, Y., Wasilewska, A., Liau, CJ. (eds) Data Mining: Foundations and Practice. Studies in Computational Intelligence, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78488-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-78488-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78487-6
Online ISBN: 978-3-540-78488-3
eBook Packages: EngineeringEngineering (R0)