关键词: 数据挖掘, 频繁模式, 逆向FP-树, 逆向FP-合并算法, 频繁扩展项

Abstract: 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.

Key words: data mining, frequent pattern, conversed FP-tree, conversed FP-merging algorithm, frequent extension item