计算机与数字工程Issue(6)：959-963,5.DOI:10.3969/j.issn1672-9722.2014.06.011
基于改进FP-Tree的最大频繁项集高效挖掘算法
Efficient Algorithm for Mining Maximum Frequent Item Sets Based on Improved FP-Tree
摘要
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 .关键词
递归/最大频繁集/FP-Tree/条件模式树/索引Key words
recursive/maximum frequent item sets/FP-Tree/conditional pattern tree/index分类
信息技术与安全科学引用本文复制引用
纪怀猛..基于改进FP-Tree的最大频繁项集高效挖掘算法[J].计算机与数字工程,2014,(6):959-963,5.
