摘要
针对数据挖掘中关联规则中Apriori算法会产生庞大的候选项集和对数据库的扫描时计算机会承担较大的I/O开销等问题,提出了一种改进方法。该方法通过对候选项集的先验剪枝和对数据库各项集进行监视优化,从而动态减少扫描项集数目,使每次扫描数据库都是精简高效的。实验证明了改进算法能有效提高挖掘速率。
According to the Apriori algorithm of the association rules in data mining,it has produced huge candidate itemsets and will occupy large I / O costs in scanning database,an improvement method has been given in the paper.Based on the pruning to the candidate and optimizing the database,it dynamic reduced the number of the scanning itemsets which made the scanning is always simplified and efficient.The experiment proves that the improved algorithm can effectively improve the mining rate.
出处
《工业控制计算机》
2013年第4期48-49,共2页
Industrial Control Computer
