摘要
挖掘最大频繁模式是多种数据挖掘应用中的关键问题。提出一种挖掘最大频繁模式的快速算法,该算法利用前缀树压缩存放数据,并通过调整前缀树中节点信息和节点链直接在前缀树上采用深度优先的策略进行挖掘,而不需要创建条件模式树,从而大大提高了挖掘效率。
Mining maximum frequent patterns is a key problem in data mining research. In this paper, a fast algorithm DMFP based on Prefix Tree for mining maximum frequent patterns is proposed. Prefix Tree stores information in a highly compact form. DMFP mines frequent patterns in depth-first order and directly in Prefix Tree by adjusting node information and node links without creating conditional pattern tree. Thus, it improves performance greatly.
出处
《计算机应用研究》
CSCD
北大核心
2006年第10期86-88,共3页
Application Research of Computers
