Maintaining the Fast Updated FP-tree from Modified Records Based on Pre-large Itemsets

In this paper, maintenance based we modify the FUFP-tree on the concept of pre-large itemsets for efficiently handling record modification. The proposed approach can achieve a good execution time for tree maintenance especially when each time a small number of records are modified. Experimental results show that the proposed pre-FUFP modification algorithm has a good performance for handling updated records and generate nearly the same tree structure as the original FP tree algorithm.