摘要： Apriori算法是著名的关联规则挖掘算法,它必须对数据库进行多次遍历。针对关联规则的维护问题,提出利用最近一次关联规则的挖掘结果进行更新的算法,仅需对数据库进行两次遍历,提高了关联规则的更新效率。
关键词:
关联规则,
频繁集,
候选集,
否定边界
Abstract: Apriori algorithm is a famous algorithm for association rules but it scans the database for several times. This paper presents a highly efficient updating algorithm based on the latest mining result for the maintenance of discovered association rules. It scans the database only two times and improves the efficiency greatly. ;;;
中图分类号:
郑奕莉,徐国定. 基于最近挖掘结果的关联规则更新算法[J]. , 2002, 28(09): 167-169.
ZHENG Yili, XU Guoding,. An Updating Algorithm Based on the Latest Mining Result for Association Rules[J]. , 2002, 28(09): 167-169.