基于FP-tree的项约束关联规则挖掘算法研究  

Research of Item Constraints Association Rules Mining Algorithm Based on FP-Tree

作　　者：王利钢[1] 陈平[1] 胡松 

机构地区：[1]南京信息职业技术学院软件学院,南京210023 [2]南京报业传媒集团,南京210000

出　　处：《信息化研究》2014年第6期11-15,共5页INFORMATIZATION RESEARCH

摘　　要：介绍了项约束关联规则的基本概念和技术现状,详细分析了FP-tree关联规则算法的关键技术。对FPC、CMFIMA、CCFP、DCMFI和CMFI五种基于FP-tree的项约束关联规则算法思想及技术进行分析和评价,通过比较,给出各算法的优点和不足,最后介绍了基于FP-tree项约束关联规则的应用,并展望了FP-tree项约束关联规则挖掘未来的研究方向,为基于FP-tree的项约束关联规则技术的研究与发展提供参考。In the paper we explain the fundaments and technology status of item constraint association rules, and analyze the key technologies of FP-tree association rules algorithm. At the same time we compare and analyze five types of typical algorithms＇ idea and technology such as FPC, CMFIMA, CCFP, DCMFI and CMFI, give the advantages and disadvantages of each algorithm, introduce the application of the item constraint association rules based on FP-tree. At the end, we review some future directions in the item constraint association rule generation algorithms. The purpose of this paper is to provide a reference for the technology research and development of item constraint rules based on FP-tree.

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

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