论文信息 - MLEM2 Rule Induction Algorithms: With and Without Merging Intervals

MLEM2 Rule Induction Algorithms: With and Without Merging Intervals

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

Jerzy W. Grzymala-Busse | J. Grzymala-Busse

[1] Jerzy W. Grzymala-Busse,et al. LERS-A System for Learning from Examples Based on Rough Sets , 1992, Intelligent Decision Support.

[2] Jan M. Zytkow,et al. Handbook of Data Mining and Knowledge Discovery , 2002 .

[3] J. Grzymala-Busse,et al. Three discretization methods for rule induction , 2001 .

[4] Jerzy W. Grzymala-Busse,et al. Three Strategies to Rule Induction from Data with Numerical Attributes , 2003, Trans. Rough Sets.

[5] Roman Słowiński,et al. Intelligent Decision Support , 1992, Theory and Decision Library.

[6] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .

[7] John H. Holland,et al. Induction: Processes of Inference, Learning, and Discovery , 1987, IEEE Expert.

[8] M. Hamburg. Statistical analysis for decision making , 1977 .

[9] Jerzy W. Grzymala-Busse,et al. A New Version of the Rule Induction System LERS , 1997, Fundam. Informaticae.

[10] D.E. Goldberg,et al. Classifier Systems and Genetic Algorithms , 1989, Artif. Intell..

[11] Jerzy W. Grzymala-Busse,et al. Global discretization of continuous attributes as preprocessing for machine learning , 1996, Int. J. Approx. Reason..

[12] Usama M. Fayyad,et al. On the Handling of Continuous-Valued Attributes in Decision Tree Generation , 1992, Machine Learning.

[13] Jerzy W. Grzymala-Busse,et al. Rough Sets , 1995, Commun. ACM.

[14] Z. Pawlak. Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .