摘要: 介绍关联规则挖掘的情况,在分析关联规则挖掘算法的基础上,通过对经典Apriori算法的改进,提出一种改进算法,该算法在计算候选大项集支持度所涉及的记录数目将小于事务数据库中原始的记录数目,实验证明该算法能够有效提高执行效率。
关键词:
数据挖掘,
关联规则,
Apriori
Abstract: Data mining is the process of discovering hidden structure or patterns in large quantities of data by using kinds of analytic tools. The paper provides a survey of the study in association rule generation. On the basis of mining association rules theory,Apriori algorithm is analyzed,and an improved Apriori algorithm is proposed. The new Apriori algorithm has the advantages of less record numbers,high efficiency and certain practical significance.
中图分类号:
冯兴杰,周谆. Apriori算法的改进[J]. , 2005, 31(S1): 180-181.
FENG Xingjie,ZHOU Zhun. Improvement for the Apriori Algorithm[J]. , 2005, 31(S1): 180-181.