基于FP-tree的多层关联规则快速挖掘算法  

Fast Mining Algorithm for Multi-level Association Rules Based on FP-tree

作　　者：曹洪其[1] 姜志峰[2] 孙志挥[2] 

机构地区：[1]南通职业大学电子工程系,南通226007 [2]东南大学计算机科学与工程系,南京210096

出　　处：《计算机工程》2007年第19期66-68,71,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(70371015)

摘　　要：研究了多层关联规则挖掘的理论和方法,提出了一种基于FP-tree的快速挖掘算法FAMML_FPT。该算法不仅实现了同层次关联规则的挖掘,也能实现跨层次关联规则的挖掘,其中引入了修补项、跨层修补项的概念,以便从低到高逐层建立FP-tree,有效减少了扫描数据库的次数,且不用产生大量的候选项集,提高了数据挖掘的效率。　This paper focuses on the research of multi-level association rules mining,and presents a fast algorithm FAMML_FPT on frequent pattern tree.This algorithm can realize data mining not only among an identical level association rule but also among cross-level association rules.In this algorithm,conceptions of the repaired items and the cross-level repaired items are brought,which is propitious to create FP-tree from lower levels to higher levels.This algorithm can reduce the scanning times of the database and eliminate the need for generating the candidate items,which improves efficiency of data mining.

关 键 词：数据挖掘 多层关联规则 频繁模式树 修补项 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]