A Mining Algorithm for Frequent Patterns Based on Prefix Tree
一种基于前缀树的频繁模式挖掘算法

Mining frequent patterns is a key problem in data mining research. Although mining based on FP-Tre achieves better performance and efficiency than Apriori-like algorithms because of avoiding costly candidate genera tion, it still suffers from creating conditional FP-Tree separately and recursively during the mining process. In this pa per, we propose a new method PTM that designs a new structure called Prefix Tree, which stores all of the informa tion in a highly compact form. PTM mines frequent patterns in depth-first order and directly in Prefix Tree by adjust ing node information and node links without using any additional data structures. Thus, it can improve performanc greatly.