摘要
本文提出了改进关联挖掘算法的数据挖掘方式.在自然连接产生候选集以前,先进行一个修剪过程,减少参加连接的项集数量,进而减小生成的候选项集规模,减少了循环迭代次数和运行时间,同时在连接判断步骤中减少多余的判断次数,避免传统方法的弊端.仿真实验证明,这种改进算法能够大幅提高数据的查询速度,取得很好的效果.
This paper puts forward the improved algorithm for mining association of data mining.In the natural connection way to generate candidate set before you a clip in the process,reduce the connection,and reduce the number of sets of the generation of candidate itemsets scale,reduce the iterative times and running time,at the same time in connection to reduce redundant judgement steps the judgment of the traditional method,avoid times the drawbacks.Simulation experiments show that the improved algorithm can greatly improve data inquires,speed got very good effect.
出处
《微电子学与计算机》
CSCD
北大核心
2012年第3期110-112,116,共4页
Microelectronics & Computer
基金
金华市科技计划项目(2007-1-067)
关键词
数据挖掘
关联规则
改进算法
data mining
association rules
improved algorithm
