| 基于频繁模式树的关联规则增量式更新算法 |
| |
| 引用本文： | 朱玉全,孙志挥,季小俊.基于频繁模式树的关联规则增量式更新算法[J].计算机学报,2003,26(1):91-96. |
| |
| 作者姓名： | 朱玉全 孙志挥 季小俊 |
| |
| 作者单位： | 1. 东南大学计算机科学与工程系,南京,210096;河海大学计算机及信息工程学院,常州,213022
2. 东南大学计算机科学与工程系,南京,210096 |
| |
| 基金项目： | 国家自然科学基金 ( 79970 0 92 )，国家科技型中小企业技术创新基金( 0 0C2 62 13 2 110 14 )资助 |
| |
| 摘 要： | 研究了大型事务数据库中关联规则的增量式更新总是，提出了一种基于频繁模式树的关联规则增量式更新算法，以处理最小支持度或事务数据库发生变化后相应关联规则的更新问题，并对其性能进行了分析。
|
| 关 键 词： | 频繁模式树 关联规则 增量式更新算法 数据挖掘 数据库 |
| 修稿时间： | 2001年8月9日 |
Incremental Updating Algorithm Based on Frequent Pattern Tree for Mining Association Rules |
| |
| ZHU Yu Quan , SUN Zhi Hui JI Xiao Jun.Incremental Updating Algorithm Based on Frequent Pattern Tree for Mining Association Rules[J].Chinese Journal of Computers,2003,26(1):91-96. |
| |
| Authors: | ZHU Yu Quan SUN Zhi Hui JI Xiao Jun |
| |
| Affiliation: | ZHU Yu Quan 1),2) SUN Zhi Hui 1) JI Xiao Jun 1) 1) |
| |
| Abstract: | The discovery of interesting association rules among huge amounts of business transaction records can help in many business decision making processes, such as catalog design, cross marketing, and loss leader analysis. There have been many algorithms proposed for efficient discovery of association rules in large databases. However, a little work has been done on maintenance of discovered association rules. This paper presents an incremental updating algorithm based on FP tree for mining association rules in the cases including inserting the transactions in the databases and modifying support. 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 authors also offer some experiments to show that the new algorithm is more efficient. |
| |
| Keywords: | data mining association rules incremental updating FP tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
