Fast Update Algorithm for Association Rule

Aiming at the maintenance problems of maximum frequent itemsets based on support change and interconversion between frequent itemsets and maximum frequent itemsets,this paper proposes three relevant algorithms.It adjusts the support rating constantly during the process of mining maximum frequent itemsets to realize fast update of maximum frequent itemsets.Based on support counting of the subsets of maximum frequent itemsets,existing maximum frequent itemsets are transformed into frequent itemsets.