Abstract

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

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.