| 一种基于事务时间分割的关联规则增量式更新方法 |
| |
| 引用本文： | 邓小妮,罗雪山. 一种基于事务时间分割的关联规则增量式更新方法[J]. 计算机工程与应用, 2004, 40(23): 176-179 |
| |
| 作者姓名： | 邓小妮 罗雪山 |
| |
| 作者单位： | 国防科技大学人文与管理学院,长沙,410073;国防科技大学人文与管理学院,长沙,410073 |
| |
| 摘 要： | 文章介绍了一种增量式关联规则更新方法,其核心思想是,将长事务以时间分割,分成一个连续的情节集合,当前情节期间获得的信息,依赖于当前的事务子集以及前面情节期间已经发现的信息。仅使用更新的事务和前面阶段的挖掘结果,增量式地产生频集。用Apriori类算法作为局部过程来产生频集,给出了具体的动态挖掘算法。
|
| 关 键 词： | 数据挖掘 关联规则 频集 增量式更新 |
| 文章编号： | 1002-8331-(2004)23-0176-04 |
An Incremental Updating Algorithm Based on Time Divided Transactions for Mining Association Rules |
| |
| Deng Xiaoni Luo Xueshan. An Incremental Updating Algorithm Based on Time Divided Transactions for Mining Association Rules[J]. Computer Engineering and Applications, 2004, 40(23): 176-179 |
| |
| Authors: | Deng Xiaoni Luo Xueshan |
| |
| Abstract: | This paper proposes an incremental updating approach based on time divided transactions for mining association rules,which discovers current data mining rules by using updates that have occurred during the current episode along with the data mining rules that have been discovered in the previous episode.An Apriori-like approach as a local procedure is used to generate large itemsets,and the detail algorithm is given. |
| |
| Keywords: | data mining association rules frequent itemsets incremental updating |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
