Abstract: This paper introduces the problem of incremental updating of frequent itemsets by the numbers. Corresponding algorithm frequent itemsets updating is presented to handle the change of the minimum support together with the transaction database including inserting and deleting the transactions in the database. The algorithm makes full use of the previous mining result to cut down the cost of updating frequent itemsets. Analysis and tests to the algorithm are offered, which shows that the algorithm is efficient and feasible.

Key words: data mining, association rules, frequent itemsets, incremental updating, FP_tree

摘要： 对频繁项目集的更新问题进行研究，提出一种基于频繁模式树的频繁项目集增量式更新算法。充分利用已有挖掘结果，有效解决最小支持度和事务数据库同时发生变化时相应频繁项目集的更新问题。在事务数据库变化同时包括增加和减少的情况下，对算法性能进行分析与测试，结果证明该算法高效可行。

关键词: 数据挖掘, 关联规则, 频繁项目集, 增量式更新, 频繁模式树

CLC Number: 

• TP311