摘要
Apriori算法是关联规则挖掘的一个经典算法,提高Apriori算法关联规则挖掘效率的关键是减少候选集的数量。通过分析、研究该算法的基本思想,文中提出利用Hash表存储技术对该算法进行改进,通过删除项Hash表来减少生成候选集的数量,从而提高算法的效率。实验结果表明,该改进算法能有效地提高关联规则挖掘的效率。
The Apriori algorithm is a classical algorithm of association rules mining. Reducing the number of candidate item sets is key to improve the efficiency of association rules mining. Studying the basic idea of Apriori algorithm, the algorithm by using Hash table technic is presented. The number of candidate item sets can be reduced by deleting Hash table of item in order to improve the efficiency of the Apriori algorithm. The results of experiment show that the improved algorithm is more efficient for association rules mining.
出处
《微机发展》
2005年第8期155-157,共3页
Microcomputer Development
基金
广东省自然科学基金资助项目(04011427)
