Year
2012
Source
2012 IEEE International Conference on Computer Science and Automation Engineering (CSAE)
Format Published
pdf
Descriptors
association rules , maximal frequent itemset , frequent pattern tree , frequent itemset
Abstract
A key issue in mining association rules is to find out
all frequent itemsets, therefore how to mine frequent itemsets
quickly has been hot in current research. Mining algorithms of
the maximal frequent itemsets based on FP-trees necessitate
not only the multiple generations of large numbers of FP-trees,
but also the multiple traversals of these FP-trees, thus taking
much time. Against the above shortcomings, we propose an
FP-tree-based algorithm MMFI optimized with array and
matrix for mining the maximal frequent itemsets. It not only
reduces the quantity of the FP-trees constructed, but also saves
the time in traversing the FP-trees. Finally, we have compared
the algorithm MMFI with the algorithm FP-MAX, the results
of our experiment have shown that this algorithm is working
efficiently.
Call. No.
EA 22
IndexDate
1397/10/01
Indexer
Dashagha
Title of Article
A New FP-tree-based Algorithm MMFI for Mining the Maximal Frequent Itemsets
RecordNumber
23
Author/Authors