| 适合在线式增量更新的关联规则挖掘算法 |
| |
| 引用本文： | 刘景春,王永利.适合在线式增量更新的关联规则挖掘算法[J].计算机工程与应用,2004,40(12):188-192. |
| |
| 作者姓名： | 刘景春 王永利 |
| |
| 作者单位： | 佳木斯大学计算机公共教学部,佳木斯,154007 |
| |
| 摘 要： | 在分析现有的关联规则算法FUP的基础上,指出了该算法的不足之处,进而提出了一种改进的增量式更新算法AUI,AUI算法解决了在线环境下最小支持度和最小置信度两个阈值不变而事务数据库发生变化时高效更新关联规则的问题。实验分析证明了新算法的有效性和优越性。
|
| 关 键 词： | 关联规则 增量式更新 频繁项目集 |
| 文章编号： | 1002-8331-(2004)12-0188-05 |
An Incremental Updating Algorithm for Online Association Rules Mining |
| |
| Liu Jingchun Wang Yongli.An Incremental Updating Algorithm for Online Association Rules Mining[J].Computer Engineering and Applications,2004,40(12):188-192. |
| |
| Authors: | Liu Jingchun Wang Yongli |
| |
| Abstract: | A novel association rules mining algorithm QAIS that differ from classical two phrase mining algorithm is proposed in this paper,then it analyzes a previously proposed algorithm FUP and points out its disadvantages.Further-more an improved incremental updating mining algorithm AUI based on QAIS has been proposed.Assuming that transac-tion database DB is updated,AUI has solved the problem of how to maintain association rules efficiently when the two thresholds,minimum support and confidence,is not changed.The experiments have shown the availability and superiority of the new a1gorithm. |
| |
| Keywords: | Association rules Incremental updating Frequent item sets |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
