Incremental mining frequent itemsets based on the trie structure and the pre-large itemsets

Incremental data mining has been discussed widely in recent years since it has many real applications. In this paper, we propose a Pre-FUT algorithm (Fast-Update algorithm using Trie data structure and the concept of pre-large itemsets), which does not only build and update the trie structure when new transactions are inserted, but also mine all frequent itemsets easily from the tree. Experimental results show the good performance of the proposed algorithm.