摘要
提出了一种基于聚类的挖掘关联规则Apriori改进算法,该算法只需扫描一次事务数据库,直接按事务项数生成聚类表,每次只需扫描部分聚类表就可生成频繁项集,减少了扫描数据库的次数和计算成本,从而有效提高挖掘关联规则的效率。
An improved apfiofi algorithm for mining association rules is proposed. In the algorithm the transaction database D is scanned only once,cluster tables are created according to the item count. Then it clusters the transaction records to the cluster tables. The frequent itewaets are gonerated by scanning the partial duster tables. The algorithm reduces the scanning times and computation cost, improves the efficieney of Apriori algorithm greatly.
出处
《计算机与数字工程》
2006年第8期28-30,93,共4页
Computer & Digital Engineering
关键词
关联规则
算法
聚类
association rule, algorithm,duster
