Efficient algorithm for incremental updating of frequent itemsets based on FP-tree
Qiu Jiang-tao · Computer Engineering and Applications Journal · 2007
Incremental updating of frequent itemsets in a database includes three problems.An algorithm FIU is proposed for the three problems.Firstly,FP-tree which save transaction recorders of database is materialized on disk.Secondly,when frequent itemsets need be found with new support threshold,only work is to read FP-tree to memory from disk,then travel the tree to find itemsets under new support threshold.Thirdly,when new data insert into database,a new item table of database need be build,then a new FP-tree is built based on the new item table.All transaction records,which were saved in FP-tree on disk,are acquired,then insert into the new FP-tree.Finally,updated frequent itemsets may be found in the FP-tree.