摘要： 提出了一种基于无向项集图的动态频繁项集挖掘算法。当事务数据库和最小支持度发生变化时，该算法只需重新遍历一次无向项集图，即可得到新的频繁项集。与传统的频繁项集挖掘算法相比，在执行效率上有显著提高。

关键词: 数据挖掘, 关联规则, 频繁项集

Abstract: The paper proposes a dynamic algorithm of frequent itemsets mining based on undirected itemsets graph. The algorithm can get the new frequent itemsets through search the undirected itemsets graph once again, when the database and the minimum support are changed. Compare with the previous algorithm of frequent itemsets mining, the efficiency is distinctly improved in discovers frequent itemsets.

Key words: Data mining, Association rules, Frequent itemsets