Home
This Title All WIREs
WIREs RSS Feed
How to cite this WIREs title:
WIREs Data Mining Knowl Discov
Impact Factor: 2.111

The lattice‐based approaches for mining association rules: a review

Full article on Wiley Online Library:   HTML PDF

Can't access this content? Tell your librarian.

The traditional methods for mining association rules (ARs) include two phrases: mining frequent itemsets (FIs)/frequent closed itemsets (FCIs)/frequent maximal itemsets (FMIs) and generating ARs from FIs/FCIs/FMIs. Lattice‐based approaches (LBAs) for mining ARs are new approaches including two phrases: frequent itemset lattice (FIL)/frequent closed itemset lattice (FCIL) building and generating ARs from the lattice. Total mining time of LBAs for mining ARs outperforms the traditional methods for mining ARs. Besides, the most important advantage of LBAs for mining ARs is that the algorithms only build the lattice once and mine ARs with many different confidences or many different minimum supports (the thresholds have to be greater than or equal to the threshold used to build lattices) without mining FIs/FCIs again. In this article, we describe a number of existing LBAs for mining ARs on static databases including lattice building and rule generation. In addition, in today's online system, the data often change in several operations such as insert, delete, and update. Hence, a number of LBAs for mining ARs on dynamic databases are mentioned. Finally, complexity analysis of the LBAs for mining ARs is also thoroughly discussed. WIREs Data Mining Knowl Discov 2016, 6:140–151. doi: 10.1002/widm.1181

FIL‐2009 for DBe with minSup = 50%.
[ Normal View | Magnified View ]
Minimal non‐redundant association rules generation on node A.
[ Normal View | Magnified View ]
Association rules with interestingness measures generation on node A.
[ Normal View | Magnified View ]
Association rules generation on node A.
[ Normal View | Magnified View ]
FCIL‐2013 for DBe with minSup = 50%.
[ Normal View | Magnified View ]
FCIL‐2005 for DBe with minSup = 50%.
[ Normal View | Magnified View ]
FIL‐2014 for DBe with minSup = 50%.
[ Normal View | Magnified View ]
FIL‐2011 for DBe with minSup = 50%.
[ Normal View | Magnified View ]

Related Articles

WIREs at JSM 2017

Browse by Topic

Algorithmic Development > Association Rules

Access to this WIREs title is by subscription only.

Recommend to Your
Librarian Now!

The latest WIREs articles in your inbox

Sign Up for Article Alerts