| 负增量式关联规则更新算法 |
| |
| 引用本文： | 张师超,张继连,陈峰,倪艾玲.负增量式关联规则更新算法[J].计算机科学,2005,32(9):153-155. |
| |
| 作者姓名： | 张师超 张继连 陈峰 倪艾玲 |
| |
| 作者单位： | 1. 悉尼科技大学信息技术学院,澳大利亚悉尼;广西师范大学计算机系,桂林,541004
2. 广西师范大学计算机系,桂林,541004 |
| |
| 基金项目： | 澳大利亚ARC项目（DP0559536）;国家自然科学基金重大项目（60496321）;国家自然科学基金项目（60463003）. |
| |
| 摘 要： | 模式维护是数据挖掘中一个具有挑战性的任务.现有的增量式关联规则更新算法主要解决两种情况下的维护问题：一是最小支持度不变,而数据量增加;二是数据量不变,而改变最小支持度.本文提出了一种负增量关联规则更新算法.实验表明,该算法是有效的.
|
| 关 键 词： | 数据挖掘 关联规则 增量更新算法 模式维护 数据库 |
Negative Incremental Updating Algorithm for Maintaining Association Rules |
| |
| ZHANG Shi-Chao,ZHANG Ji-Lian,CHEN Feng,NI Ai-Ling.Negative Incremental Updating Algorithm for Maintaining Association Rules[J].Computer Science,2005,32(9):153-155. |
| |
| Authors: | ZHANG Shi-Chao ZHANG Ji-Lian CHEN Feng NI Ai-Ling |
| |
| Affiliation: | 1.Faculty of Information Technology, University of Technology Sydney, Australia;2.Department of Computer Seience,GuangXi Normal University,Guilin 541004 |
| |
| Abstract: | Pattern maintenance is a challenging task in data mining. Existing incremental updating algorithms are de- signed for maintaining association rules in two ways. One is to maintain association rules with a constant minimal sup- port while new data is added to original database. Another is to maintain association rules with different minimal sup- ports and a constant database size. In this paper, a new algorithm, called Negative Incremental Updating Algorithm (NIUA), is proposed for maintaining association rules. We experimentally evaluate the proposed approach, and illus- trate that our algorithm is efficient and promising. |
| |
| Keywords: | Data mining Association rules Incremental updating algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机科学》浏览原始摘要信息 |
|
点击此处可从《计算机科学》下载全文 |
|
