一种基于升序FP-tree的频繁模式挖掘算法

One Frequent Pattern-Mining Algorithm Based on Sort Ascending FP-tree

本文提出了一种基于升序FP-tree的频繁模式挖掘算法,该算法按照支持度升序构造升序FP-tree,并通过在其中搜索扩展频繁集及归并子树来挖据频繁模式。实验表明,与FP-growth算法相比,算法的挖掘速度提高了将近2倍,此外新算法还具有比较好的伸缩性。

An alortithm for mining frequent patterns based on sort ascending FP-tree is proposed. It builds the FP-tree by support sort ascending,and it mines frequent patterns by finding the extended frequent itemset and merging subtrees. Experiments show that in comparison with FP-growth,this algorithm almost has accelerated the mining speed by three times,moreover,it has a good scalability.