An Improved Incremental Updating Algorithm for Association Rules

Fast Update(FUP) algorithm always produces a lot of candidate itemsets and scans database many times,so a new improved Fast Updating(NFUP) algorithm is presented to solve such two bottleneck problems of FUP.This algorithm produces fewer candidate itemsets and fewer number of times scanning database,because it obtains all frequent item sets through frequent itemsets' relations of new and old database and uses the existing results as far as possible.Simulation shows that the execution time of NFUP algorithm reduces a lot compared with FUP algorithm in the case of the same database.