Mining minimal non-redundant association rules using frequent itemsets lattice
by Bay Vo, Bac Le
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 10, No. 1, 2011

Abstract: In this paper, we present an application of frequent itemsets lattice (FIL) to mine minimal non-redundant association rules (MNARs) that reduces a lot of time for mining rules. Our method includes two phases: (1) building FIL and (2) mining MNARs from lattice. we extend the structure of FIL by adding one field to consider whether a lattice node is a minimal generator (mG) or not, and another field to consider whether a lattice node is a frequent closed itemset or not. MNARs are only mined from a minimal generator X to frequent closed itemset Y such that X⊂Y. The experiments show that the mining time from FIL is more effective than that from frequent closed itemsets.

Online publication date: Tue, 25-Jan-2011

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 Intelligent Systems Technologies and Applications (IJISTA):
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