一种改进的Apriori算法  

An Improved Apriori Algorithm

作　　者：朱庆[1] 恰汗.合孜尔 

机构地区：[1]新疆农业大学计算机与信息工程学院,乌鲁木齐830052 [2]新疆农业大学数理学院,乌鲁木齐830052

出　　处：《计算机与数字工程》2010年第4期30-32,共3页Computer & Digital Engineering

摘　　要：关联规则挖掘是数据挖掘研究的重要内容之一。通过对关联规则挖掘算法的详细分析,提出了一种基于有向关联图的频繁项集挖掘算法,该方法仅需扫描数据库一次,避免了Apriori算法繁琐的连接和删除步骤,从而提高了搜索速度。Mining association rules is one of the most important topics in data mining.After the method for mining association rules is analyzed,a algorithm of frequent itemsets mining based on directed association graph is put forward.It only needed one times of scanning,and had avoided the tedious connection step and the deletion step of the Apriori algorithm,but also has the virtues in high speed.

关 键 词：数据挖掘 关联规则 频繁项集 有向关联图 

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