It proposed an algorithm for mining frequent patterns by finding the frequent extensions and merging sub-trees in a conversely constructed FP-tree.

• 摘要提出了一种称为逆向FP-合并的算法，该算法逆向构造FP-树并通过在其中寻找频繁扩展项集与合并子树来挖掘频繁模式。