Abstract: Incremental updating of association rules is an important content of data mining technology.In this paper，the problem of Incremental updating of association rules is introduced by the numbers and corresponding algorithm is presented to handle the changing of the minimum support together with the transaction database（including inserting and deleting the transactions in the database）.Some analyses and tests to the algorithm are offered at the end of the paper.

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

摘要： 关联规则的更新是数据挖掘研究的一个重要内容，能否有效地挖掘出动态事务数据库中的最大频繁项目集是衡量一个关联规则更新算法好坏的关键因素。提出基于FP_tree的最大频繁项目集增量式更新（MFIUP）算法，以处理最小支持度和事务数据库同时发生变化之后相应频繁项目集的更新问题，其中事务数据库的变化同时包括增加和减少两种情况，并对其优越性进行了分析和测试。

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