数据挖掘中的增量式关联规则更新算法

An Efficient Incremental Updating Algorithm in Data Mining for Maintaining Association Rules

设计增量关联规则更新算法,用于解决数据挖掘中元组数增加而最小支持度不发生变化时关联规则增量式更新问题。该算法只须扫描原始数据库和新增数据库各一遍,能大大降低运算时间,加快速度,极大地提高关联规则的挖掘性能。

Updating association rules is an inevitable yet important issue in data mining. This paper presents a highly efficient updating algorithm, referred to AIUA algorithm, for incrementally maintaining association rules with the same minimum support. This algorithm only takes one scan on both the original database and the increased dataset. We experimentally evaluated our approach,and demonstrated the efficiency and promising.