Pruning irrelevant association rules using knowledge mining Online publication date: Fri, 24-Oct-2014
by Youcef Djenouri; Habiba Drias; Ahcene Bendjoudi
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 9, No. 2, 2014
Abstract: The efficiency of existing association rules mining algorithms afford large number of delivered rules that the user can not exploit them easily. Consequently, thinking about another mining of these generated rules becomes essential task. For this, the present paper explores metarules extraction in order to prune the irrelevant rules. It first focuses on clustering association rules for large datasets. This allows the user better organising and interpreting the rules. To more go down in our mining, different dependencies between rules of the same cluster are extracted using meta-rules algorithm. Then, pruning algorithm uses these dependencies to delete the deductive rules and keep just the representative rules for each cluster. The proposed approach is tested on different experiments including clustering, meta-rules and pruning steps. The result is very promising in terms of the number of returned rules and their quality.
Online publication date: Fri, 24-Oct-2014
Go to Inderscience Online Journals to access the Full Text of this article.
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 Business Intelligence and Data Mining (IJBIDM):
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