挖掘关联规则算法的优化处理  

Algorithm Optimization of Mining Association Rules

作　　者：陆丽娜[1] xjtu.edu.cn 陈亚萍[1] xjtu.edu.cn 杨麦顺[1] xjtu.edu.cn 魏恒义[1] xjtu.edu.cn 

机构地区：[1]西安交通大学计算机科学与技术系

出　　处：《计算机工程与应用》2000年第8期99-102,共4页Computer Engineering and Applications

摘　　要：在挖掘关联规则的执行过程中，早期循环生成最大项目集的过程是很重要的。文中提出基于哈希表的算法，对生成侯选项目集的过程进行了优化，尤其是对生成二维侯选项目集更是有效。由于在早期循环中，生成侯选项目集的势较小，使得能更有效地修剪数据库，从而减小了后期循环的计算代价，同时也减小了I／O请求。To find all the large itemsets from candidate sets in eary iterations is usually the domaining factor foroverall data-mining performance. In the paper,we option the algorithm Apriori for the candidate set generation. It is ahash-based algorithm and is especially effective for the generation of candidate set for large 2-itemsets. Furthermore thegeneration of smaller candidate sets enables us to effectively trim the transaction database size at a much earier stageof the iterations,thereby reducing the computational cost for later iterations. The advantage of proposed algorithm alsoprovides us the opportunity of reducing the amount of disk I/O required.

关 键 词：数据挖掘 关联规则 算法 优化处理 数据库 

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