On the basis of the fast mining algorithm for global maximum frequent itemsets,an incremental updating algorithm, named as IUGMFI algorithm, was proposed. The algorithm made use of the global frequent items and global maximum frequent itemsets in distributed database. Firstly, the global frequent items were mined in incremental distributed database. Secondly, the FP-tree was constructed in incremental distributed database. Thirdly, the global maximum frequent itemsets were mined in incremental distributed database. Finally, the global maximum frequent itemsets were updated by the strategy of top-down. Theoretical analysis and experimental results showed that IUGMFI algorithm is fast and effective.
