Redundant association rules reduction techniques
by Mafruz Zaman Ashrafi, David Taniar, Kate Smith
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 2, No. 1, 2007

Abstract: To discover hidden correlations, association rule mining methods use two important constraints known as support and confidence. However, mining methods are often unable to find the best value for these constraints: large number of rules when these thresholds are low; very few rules when these thresholds are high. In addition, regardless of these above thresholds, mining methods produce many rules that have identical meaning or, redundant rules. Indeed such redundant rules seem as a main impediment to efficient utilisation of discovered rules, and should be removed. To achieve this aim, here we present several methods that identify those rules that are redundant and eliminate them.

Online publication date: Sat, 31-Mar-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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:

Username:        Password:          Forgotten your 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 subs@inderscience.com