一种基于数据库分解的关联规则挖掘新算法  

A New Algorithm for Mining Association Rules Based on Dataset Division

作　　者：杨翠明[1] 刘喜苹[2] 熊高峰[1] 罗隆福[1] 

机构地区：[1]湖南大学电气与信息工程学院,湖南长沙410082 [2]长沙南方职业学院,湖南长沙410208

出　　处：《湖南师范大学自然科学学报》2007年第2期30-34,共5页Journal of Natural Science of Hunan Normal University

基　　金：国家技术创新资助项目[国经贸技术(2002)845号]

摘　　要：在Fp-growth算法的基础上,提出了一种新颖的关联规则挖掘算法.该算法将大型数据库分解成频繁1-项集的项总数个子集,然后对分解得到的各个数据库子集用Fp-growth算法进行约束项数据挖掘,待所有数据库子集的约束项数据挖掘进行完毕后,再合并这些约束频繁项得到大型数据库的频繁项集.实验结果表明新算法所采用的数据库划分策略克服了FP-growth算法对大型数据库进行挖掘时,占用内存大,运行速度慢的不足,是一种适合于大型数据库的关联规则挖掘算法.Fp-growth algorithm has disadvantages such as lower space utilization rate and slower execution time when mining the large datasets. To overcome these drawbacks, based on the Fp-growth algorithm, this paper proposed a new algorithm for mining association rules from large datasets. The algorithm adopts a new strategy to divide the large datasets into many subsets, and then, carries out constrained frequent item sets mining for each subset. Experiments have been conducted to compare the proposed algorithm with the Fp-growth algorithm. Experimental results show that the algorithm has lower memory usage, and is faster than the Fp-growth algorithm when the datasets is very large.

关 键 词：大型数据库 关联规则 数据库分解 数据挖掘 约束频繁项挖掘 FP-GROWTH 

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