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.

• 当事务数据库和最小支持度发生变化时,该算法只需重新遍历一次无向项集图即可得到新的频繁项集。