摘要
关联规则挖掘是数据挖掘研究的重要内容之一。通过对关联规则挖掘算法的详细分析,提出了一种基于有向关联图的频繁项集挖掘算法,该方法仅需扫描数据库一次,避免了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.
出处
《计算机与数字工程》
2010年第4期30-32,共3页
Computer & Digital Engineering
关键词
数据挖掘
关联规则
频繁项集
有向关联图
data mining
association rules
frequent itemset
directed association graph
