一种新的高效生成FP-Tree条件模式基的算法  

New algorithms for effectively creating conditional pattern bases of FP-Tree

作　　者：周钦亮[1] 李玉忱[1] 公爱国[1] 

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

出　　处：《计算机应用》2006年第6期1418-1421,共4页journal of Computer Applications

摘　　要：FP-Tree模式的提出,提高了挖掘效率,是关联规则挖掘史上的一个历程碑。频繁模式增长算法在求取条件模式基时,重复遍历FP-Tree的路径,造成了性能上的浪费。针对此问题,提出一种解决方法,即在遍历FP-Tree每条由叶子到根路径过程中,依次将路径上的所有结点对应项的条件模式基信息求出并保存,避免了同一路径的重复遍历。理论分析和实验结果表明,修改后的算法的性能明显优于原算法。The frequent pattern approach is undoubtedly a great milestone in the history of mining association rules, which greatly improved the mining effectiveness. However, Paths in Frequent Pattern Tree（FP-Tree） are repeatedly scaned in creating conditional pattern base, which results in great unnecessary performance overhead. In order to solve this problem, the information for creating conditional pattern base of the items related to each node of the path was computed and stored in the traverse of each path from leaves to the root, which avoided repeat scan of a single path. .It is showed from the results of experiments that the revised ones obviously outperform the previous ones.

关 键 词：数据挖掘 关联规则 频繁模式增长 条件模式基 

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