一种基于FP-tree的最大频繁项目集挖掘算法  

Algorithm for mining maximum frequent itemsets based on FP-tree

作　　者：刘乃丽[1] 李玉忱[1] 马磊[1] 

机构地区：[1]山东大学计算机科学与技术学院,山东济南250061

出　　处：《计算机应用》2005年第5期998-1000,共3页journal of Computer Applications

摘　　要：挖掘关联规则是数据挖掘领域中的重要研究内容,其中挖掘最大频繁项目集是挖掘关联规则中的关键问题之一,以前的许多挖掘最大频繁项目集算法是先生成候选,再进行检验,然而候选项目集产生的代价是很高的,尤其是存在大量长模式的时候。文中改进了FP 树结构,提出了一种基于FP tree的快速挖掘最大频繁项目集的算法DMFIA 1,该算法不需要生成最大频繁候选项目集,比DMFIA算法挖掘最大频繁项目集的效率更高。改进的FP 树是单向的,每个结点只保留指向父结点的指针,这大约节省了三分之一的树空间。Mining association rule is an important matter in data mining, in which mining maximum frequent itemsets is a key problem in mining association rule. Many of the previous algorithms mine maximum frequent itemsets by producing candidate itemsets firstly, then pruning. But the cost of producing candidate itemsets is very high, especially when there exist long patterns. In this paper, the structure of a FP-tree was improved, a fast algorithm DMFIA-1 based on FP-tree for mining maximum frequent itemsets was proposed, which did not produce maximum frequent candidate itemsets and was more effective than DMFIA. The new FP-tree is a one-way tree and there is no pointer pointing its children in each node, so at least one third of memory is saved.

关 键 词：数据挖掘 最大频繁项目集 关联规则 频繁模式树 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]