Optimized algorithm for mining maximum frequent itemsets on association rule

摘要

Aiming at the weakness of traditional Apriori algorithm, this paper presents MFI algorithm for mining maximum frequent itemsets on association rules. MFI algorithm scans database only once, the algorithm need not produce candidate itemsets, MFI algorithm does not use the method of iteration for each layer, MFI algorithm adopts binary bit and logic operation. The efficiency is distinctly improved in mining maximum frequent itemset.