Analysis and implementation of the algorithm of FP-growth
Ziguang Sun · 2005
FP-growth is the algorithm mining frequent itemsets without generating candidate itemsets,and it is important to analyze and implement it.This paper first analyzes this algorithm,then discusses the implementation of the algorithm based on C++ STL.In the end,the efficency of FP-growth has been compared with Apriori in some datasets,the better performance has been got.