Efficient Algorithm for Mining Maximum Frequent Item Sets Based on Improved FP-Tree
JI Huaimeng
Abstract：The efficiency of the algorithm for mining maximum frequent set is greatly reduced ,when the algorithm named FP-Max based on FP-Tree is used in mining maximum frequent item sets .Because it needs recursively to establish conditional pattern tree ,and take a lot of storage space .A new algorithm named FP-EMax based on improved FP-Tree is put forward for efficiently mining maximum frequent sets .The efficiency of the new algorithm is greatly increased ,because not only it doesn't need to establish conditional pattern library ,which greatly reduces the storage space overhead ;but also it uses pruning to reduce the number of establishing conditional pattern tree and testing subset .Finally ,the experiments show that the algorithm has a better performance than the FP-Max algorithm and other similar algorithms in the case of a relatively small support .
Keywords：recursivemaximum frequent item setsFP-Treeconditional pattern treeindex
Publication Date：2014-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：5( 959-963 )