摘要
Apriori算法是整个关联规则算法的基础。它必须对数据库进行重复性扫描。效率低,耗时巨大。针对关联规则的维护问题,提出利用已生成关联规则的挖掘结果进行更新的算法,仅需对数据库进行两次扫描,提高了关联规则的更新效率。
Apriori algorithm is a basic algorithm for all association rules,but it is Low-efflcient and time-consuming that requires the scanning of the database repeatedly. It is presented in this paper with a highly efficient updating algorithm based on the latest mining result for the maintenance of discovered association rules which requires only two times scanning of the database and improves the efficiency greatly.
出处
《闽江学院学报》
2005年第5期58-61,共4页
Journal of Minjiang University
关键词
数据挖掘
关联规则
频繁集
算法
data mining
Association rule
Frequent itemset
algorithm
