Fast Mining Maximum Frequent Itemsets
Song Lu · 2001
Discovering maximum frequent itemsets is a key problem in many data mining applications. In this paper, the DMFI (discovery maximum frequent itemsets) algorithm which combines the bottom up and top down searches is proposed to solve this problem. Using the unique ordering method and efficient pruning strategy, the number of candidate itemsets is greatly decreased, therefore CPU time is reduced remarkably.