A New Incremental Updating Algorithm for Association Rules
Incremental data mining is an attractive goal for many kinds of mining in large databases or data warehouses. In this paper, 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 will make use of previous association rules as seed rules. By RGA, we can confirm seed rules are strong rules or not, and need not scan all the transaction DB in most case. 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 show that our algorithm is efficient.
Zuocheng Wang Lixia Xue
Software Institute, Chongqing University of Post and Telecommunication, ChongQing 400065,china College of Computer Science and Technology, Chongqing University of Post and Telecommunication,Chong
国际会议
重庆
英文
190-195
2007-04-24(万方平台首次上网日期,不代表论文的发表时间)