基于改进的FP-tree的频繁模式挖掘算法  

Frequent pattern mining algorithm based on improved FP-tree

作　　者：李也白[1] 唐辉[1] 张淳[2] 贺玉明[1] 

机构地区：[1]北方工业大学信息工程学院,北京100144 [2]北京地坛医院器械科,北京100015

出　　处：《计算机应用》2011年第1期101-103,共3页journal of Computer Applications

摘　　要：FP-growth算法是一种基于FP-tree数据结构的高效的频繁模式挖掘算法,它不产生候选集。构造频繁模式树FP-tree需扫描数据库两次,在第二遍扫描中还扫描了那些仅包含了非频繁项的事务,针对此问题,在深入分析了FP-tree特性的基础上,改进了FP-tree构造过程,同时用一种基于Hash表的辅助存储结构,节省了项目查找时间,提高了挖掘效率。FP-growth is an efficient frequent pattern mining algorithm based on the data structure of FP-tree, which does not generate candidate sets. Constructing frequent pattern tree TP-tree requires to scanning data twice. What＇s more, transactions which only contain non-frequent items are also scanned during the second scanning. In order to solve this problem, after analyzing particularity of FP-tree deeply, this paper improved construction process of FP-tree and employed an auxiliary storage structure that bases on hash table, which saves time of searching items and enhances mining efficiency.

关 键 词：数据挖掘 关联规则 频繁模式 FP—growth算法 FP—tree 

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