| 一种有效的关联规则增量式更新算法 |
| |
| 引用本文： | 朱玉全,孙志挥. 一种有效的关联规则增量式更新算法[J]. 计算机工程与应用, 2001, 37(23): 28-29,90 |
| |
| 作者姓名： | 朱玉全 孙志挥 |
| |
| 作者单位： | 东南大学计算机科学与工程系, |
| |
| 基金项目： | 国家自然科学基金(编号:79970092)，国家中小型企业创新基金(编号:00C26213211014)资助 |
| |
| 摘 要： | 关联规则是数据挖掘中的一个重要研究内容。目前已经提出了许多用于高效地发现大规模数据库中的关联规则的算法,而对已发现规则的更新及维护问题的研究却较少。文章提出了基于频繁模式树的关联规则增量式更新算法,以处理事务数据库中增加了新的事务数据集后相应关联规则的更新问题,并对其性能进行了分析。
|
| 关 键 词： | 数据挖掘 关联规则 增量式更新 频繁模式树 |
| 文章编号： | 1002-8331-(2001)23-0028-02 |
A Efficient Incremental Updating Algorithm for Mining Association Rules |
| |
| Zhu Yuquan Sun Zhihui. A Efficient Incremental Updating Algorithm for Mining Association Rules[J]. Computer Engineering and Applications, 2001, 37(23): 28-29,90 |
| |
| Authors: | Zhu Yuquan Sun Zhihui |
| |
| Abstract: | Mining association rules is an important part of data mining field.There have been many algorithms proposed for efficient discovery of association rules in large databases.However,little work has been done on maintenance of discovered association rules.In this paper,we present an incremental updating algorithm based on FP-tree for mining association rules when new transaction data are added to a transaction database.The proposed algorithm makes use of the previous mining result to cut down the cost of finding new rules in an updated database.Comparing with FUP algorithm,the author also offers some experiments to show that the new algorithm is more efficient. |
| |
| Keywords: | data mining association rules incremental updating FP-tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
