数据立方体上多维多层关联规则挖掘算法  

Multi-dimension and Multi-level Association Rule Mining Algorithm on Data Cube

作　　者：贺琼[1] 刘潭仁[1] 郭平[1] 

机构地区：[1]重庆大学计算机学院,重庆400044

出　　处：《计算机应用》2004年第3期85-88,共4页journal of Computer Applications

基　　金：国家十五攻关项目 (2 0 0 2BA1 0 7B)

摘　　要：重点结合联机分析挖掘的思想,讨论了数据立方体上的多维多层关联规则挖掘。基于数据立方体和FP算法提出并构建了体现概念层次的Hib＆Dim FP树和其挖掘算法Hib＆Dim FP算法,并把此算法应用于数据立方体上的多维多层关联规则挖掘。最后的实验证明了该算法的有效性。Combined with the idea of OLAM, the mining of multi-dimension and multi-level association rule on data cube are discussed especially. Based on data cube and FP algorithm, a new FP tree named Hib&Dim-FP tree, which contains the concept hierarchy, is proposed and built,and the mining algorithm named Hib&Dim-FP algorithm based on Hib&Dim-FP is introduced for mining multi-dimension and multi-level association rule on data cube. Lastly the algorithm is realized on experiment and is proved to be valid.

关 键 词：数据挖掘 多维关联规则 多层关联规则 数据立方体 

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