关联规则挖掘Apriori算法的优化-计算机系统应用.PDFVIP

计 算 机 系 统 应 用 2010 年 第19卷 第 8 期 ① 关联规则挖掘 Apriori 算法的优化 王胜和 (安徽公安职业学院 公安科技系 安徽 合肥 230031) 朱玉全 (江苏大学 计算机科学与通信工程学院 江苏 镇江 212000) 摘 要： 针对 Apriori 算法存在的不足，提出了一种新的优化 Apriori 的方法。该方法通过优化频繁项集修剪 策略，减少无效候选项集的产生；优化连接策略，减少连接次数，避免相同项目的多次重复比较；结 合事务数据库逐步压缩技术，减少对无用事务的扫描次数。实验结果表明，经过优化的 Apriori 算法 具有更好的运行效率。 关键词： 关联规则; apriori 算法;事务压缩;数据挖掘 Optimized Apriori Algorithm for Mining Association Rules WANG Sheng-He (Department of Public Security Technology, Anhui Police Professional College, Hefei 230031, China) ZHU Yu-Quan (School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang 212013, China) Abstract: To address disadvantages of the Apriori algorithm, a new method is presented to optimize the Apriori. It can reduce the number of invalid candidate item sets through optimizing the strategy of frequent item sets pruning. In order to reduce the connections of items, avoid repeated comparison of the same items, it optimizes the joining strategy. And it also removes the useless transactions from database step by step in order to reduce the times of scanning transactions. The results of experiment show that the optimized algorithm is more efficient. Keywords: association rule; apriori algorithm; transaction reduction; data mining 1 引言