最大频繁项目集的增量式更新算法

发现最大频繁项目集是多种数据挖掘应用中的关键问题,目前已经提出了许多算法用于发现最大频繁项目集,而对最大频繁项目集维护问题的研究工作却不多,因此,迫切需要设计高效的算法来更新、维护和管理已挖掘出来的最大频繁项目集,为此,该文提出了一种快速的增量式更新最大频繁项目集算法IUAFI,并举例说明了算法的执行过程。

Incremental Updating Algorithm for Mining Maximum Frequent Itemsets

Mining maximum frequent itemsets is a key problem in important data mining application,such as the dis-covery of association rules,strong rules,episodes,and minimal keys.There have been many algorithms proposed for effi-cient discovery of maximum frequent itemsets.However,very little work has been done on maintenance of discovered maximum frequent itemsets.So,it is importance to design efficient algorithms to update,maintain and manage maximum frequent itemsets discovered.In this paper,IUAFI is presented for efficient maintenance of maximum frequent itemsets when new transaction data is added to a transaction database.