一种基于树的频繁模式挖掘算法  

A Tree-Based Frequent Pattern Mining Algorithm

作　　者：刘君强[1] 潘云鹤[1] 

机构地区：[1]浙江大学计算机科学与技术学院

出　　处：《系统工程理论与实践》2003年第5期108-112,共5页Systems Engineering-Theory & Practice

基　　金：浙江省自然科学基金 ( 60 2 1 40 ) ;国家 863计划 ( 2 0 0 2 AA1 2 1 0 64) ;浙江省教育厅科技计划 ( 2 0 0 2 0 63 5)

摘　　要：提出了一种基于树的频繁模式挖掘算法 TBA-FP.它以树表示法压缩数据库所含模式信息 ,将挖掘问题转化为按深度优先策略构造频繁模式树 ,并引入了虚拟裁剪等优化技术 .实验表明 ,TBA-FP挖掘“长”模式的时间效率与空间可伸缩性远远优于经典算法A tree\|based algorithm for mining of frequent patterns, TBA\|FP, is proposed in this paper. The term, tree\|based, has two meanings. First, a tree\|based representation is used to compress the pattern information in the database. Second, the mining process is regarded as a process of constructing a frequent pattern tree in depth first order. Optimizing techniques, such as pseudo clipping, is discussed. Experiments show that TBA\|FP is much more efficient and scalable than the classical algorithm, Apriori.

关 键 词：频繁模式 数据挖掘 海量数据库 

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