摘要： 为了能够随着数据库的增加、删除和修改而快速有效地挖掘出频繁闭项集，根据CHARM算法提出了一种基于频繁闭项集挖掘的增量式维护算法。该算法采取分类处理的策略对变化数据进行挖掘，运用IT对的特性从已挖掘出的结果中快速过滤出仍然有效的信息，实现频繁闭项集的更新。实验结果表明该算法是快速有效的。

关键词: 频繁闭项集, CHARM算法, 增量式维护算法, IT对

Abstract: In order to mine fast and efficiently frequent closed itemsets according to insertion, deletion and modification of the database, this paper proposes an incremental maintaining algorithm U_CHARM based on CHARM algorithm. The algorithm partitions data into different groups to achieve the update of frequent closed itemsets, in which changed data are used to mine frequent closed itemsets and valid information is obtained from previous results by utilizing the properties of IT pairs. Experimental results demonstrate that the algorithm is fast and efficient.

Key words: frequent closed itemsets, CHARM algorithm, incremental maintaining algorithm, IT pairs

中图分类号: 

• TP311