基于逆向FP-树的频繁模式挖掘算法

Algorithm for mining frequent patterns based on converse FP-tree

提出了一种称为逆向FP 合并的算法,该算法逆向构造FP 树并通过在其中寻找频繁扩展项集与合并子树来挖掘频繁模式。新算法在时空效率方面均优于FP 增长算法,其中时间效率提高了2倍以上。此外,新算法还具有良好的伸缩性。

It proposed an algorithm for mining frequent patterns by finding the frequent extensions and merging sub-trees in a conversely constructed FP-tree. The performance of the algorithm is superior to the one of FP-Growth both in time and space consuming. It runs over two times faster than the FP-Growth and has a good scalability.