Experiments on mining inconsistent data with bagging and the MLEM2 rule induction algorithm Online publication date: Thu, 24-May-2012
by Clinton Eugene Cohagan; Jerzy Witold Grzymala-Busse; Zdzislaw S. Hippe
International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS), Vol. 2, No. 3, 2012
Abstract: We report results of experiments on mining inconsistent data using bagging combined with the MLEM2 rule induction algorithm based on rough set theory. The main objective of this paper was to compare the quality of rule sets induced using two different approaches to inconsistency lower and upper approximations and three different approaches to ensemble voting based on support, strength and majority in the bagged MLEM2. Our main conclusion is that there is no significant difference in performance between one of the most successful techniques used in bagging, majority voting, and voting based on support (two-tailed Wilcoxon test, 5% level of significance).
Online publication date: Thu, 24-May-2012
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com