| 基于最近挖掘结果的关联规则更新算法 |
| |
| 引用本文： | 郑奕莉,徐国定.基于最近挖掘结果的关联规则更新算法[J].计算机工程,2002,28(9):159-161. |
| |
| 作者姓名： | 郑奕莉 徐国定 |
| |
| 作者单位： | 华东师范大学计算机科学系,上海,200062 |
| |
| 摘 要： | Apriori算法是著名的关联规则挖掘算法，它必须对数据库进行多次遍历，针对关联规则的维护问题，提出利用最近一次关联规则的挖掘结果进行更新的算法，仅需对数据库进行两次遍历，提高了关联规则的更新效率。
|
| 关 键 词： | 关联规则 频繁集 候选集 否定边界 数据库 数据挖掘 Apriori算法 |
| 文章编号： | 1000-3428(2002)09-0159-03 |
| 修稿时间： | 2001年10月29 |
An Updating Algorithm Based on the Latest Mining Result for Association Rules |
| |
| ZHENG Yili,XU Guoding,.An Updating Algorithm Based on the Latest Mining Result for Association Rules[J].Computer Engineering,2002,28(9):159-161. |
| |
| Authors: | ZHENG Yili XU Guoding |
| |
| Affiliation: | Computer Science DepartmentEast China Normal UniversityShanghai 200062 |
| |
| 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. ;;; |
| |
| Keywords: | Association ruleFrequent itemsetCandidate itemsetNegative border |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
