关联规则算法的实现与改进  

Realization and Optimization of Association Rule Mining Algorithm

作　　者：辛志[1] 刘少辉[2] 史忠植[2] 

机构地区：[1]中国科技大学研究生院,北京100039 [2]中国科学院计算技术研究所智能信息处理重点实验室,北京100080

出　　处：《计算机工程与应用》2002年第24期190-192,共3页Computer Engineering and Applications

摘　　要：关联规则作为一种数据挖掘的工具,它能够发现数据项集之间有趣的关联。在关联规则的算法中,Apriori算法是其中的关键算法之一。面对大量复杂的数据集,怎样选择数据结构,怎样优化处理过程,对于此算法的性能将会十分重要。该文首先介绍了关联规则的原理和Apriori算法的实现,然后提出了对该算法的若干改进,例如:采用树型结构存取频繁项集,使用三种缓存优化的方法等。这些优化都能够在整体上提高算法的效率。对于大数据项,试验显示,这些改进能够正确、有效、快速地实现Apriori算法。Association rule mining searches for interesting relationships among items.Association rule is now used as one of efficient data mining tools.In all association rule algorithms ,the apriori algorithm is one of the keys.To huge scale and complex of data sets,how to choose the data structure,how to optimize the process,are all very important for the performance of the algorithm.This paper first introduces the principle of association rule and its realization by apri-ori algorithm.Then some improvements of apriori algorithm are proposed,such as creating a tree structure to store all frequent itemsets and using three kinds of cache optimization methods.These optimization can improve the algorithm ef-ficiency at the whole.The experiments show these improvements proposed in this paper can realize the Apriori algorithm accurately,efficiently and quickly in large data sets.

关 键 词：关联规则算法 数据挖掘 频繁项集 数据库 APRIORI算法 

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