Maximum frequent itemsets mining algorithm based on improved FP-tree
基于改进FP-树的最大项目集挖掘算法*

Mining maximum frequent itemsets is a key problem in many data mining application.FP-growth algorithm is one of the most efficient frequent pattern mining methods.However,FP-growth algorithm must generate a huge number of conditional FP-trees recursively in processes of mining maximum frequent,so the efficiency of it unsatisfactory.This paper proposed an efficient mining maximum frequent algorithm,it unified the improvement FP-tree.The FP-tree was a one-way tree and there is no pointers to point its childre...