| A new incremental updating algorithm for association rules |
| |
| 作者姓名： | WANG Zuo-cheng XUE Li-xia |
| |
| 作者单位： | [1]Software Institute, Chongqing University of Posts and Telecommunications ,Chongqing 400065 ,P. R. China [2]College of Computer Science and Technology, Chongqing University of Posts and Telecommunications ,Chongqing 400065 ,P. R. China |
| |
| 基金项目： | The work is supported by Chongqing Municipal Education Commission Science Research Program （No. KJ060511） |
| |
| 摘 要： | Incremental data mining is an attractive goal for many kinds of mining in large databases or data warehouses. A new incremental updating algorithm rule growing algorithm (RGA) is presented for efficient maintenance discovered association rules when new transaction data is added to a transaction database. The algorithm RGA makes use of previous association rules as seed rules. By RGA, the seed rules whether are strong or not can be confirmed without scanning all the transaction DB in most cases. If the distributing of item of transaction DB is not uniform, the inflexion of robustness curve comes very quickly, and RGA gets great efficiency, saving lots of time for I/O. Experiments validate the algorithm and the test results showed that this algorithm is efficient.
|
| 关 键 词： | assocation rules incremental updating aprion growing |
| 文章编号： | 1673-825X（2007）03-0309-05 |
| 收稿时间： | 2007-02-10 |
| 修稿时间： | 2007-02-10 |
A new incremental updating algorithm for association rules |
| |
| WANG Zuo-cheng,XUE Li-xia.A new incremental updating algorithm for association rules[J].Journal of Chongqing University of Posts and Telecommunications,2007,19(3):309-313. |
| |
| Authors: | WANG Zuo-cheng XUE Li-xia |
| |
| Abstract: | Incremental data mining is an attractive goal for many kinds of mining in large databases or data warehouses. A new incremental updating algorithm rule growing algorithm (RGA) is presented for efficient maintenance discovered association rules when new transaction data is added to a transaction database. The algorithm RGA makes use of previous association rules as seed rules. By RGA, the seed rules whether are strong or not can be confirmed without scanning all the transaction DB in most cases. If the distributing of item of transaction DB is not uniform, the inflexion of robustness curve comes very quickly, and RGA gets great efficiency, saving lots of time for I/O. Experiments validate the algorithm and the test results showed that this algorithm is efficient. |
| |
| Keywords: | assocation rules incremental updating aprion growing |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《重庆邮电大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆邮电大学学报(自然科学版)》下载免费的PDF全文 |
