Incremental update algorithm of association rules combining with moment checking
与时机判定相结合的关联规则增量更新算法

Most of the present update algorithms of association rules are devoted to solve the problem of incremental update, but seldom check the update moment simultaneously. It is unsuitable to deal with the data in real time applications which are updated frequently. An improved incremental update algorithm of association rules is proposed. It includes the moment checking phase and the incremental update phase. In the phase of moment checking, the difference between association rules is calculated to decide whether update or not. During the phase of incremental update, frequent itemsets whose number of non-empty subsets is the largest are acquired firstly, and the pruning of candidate itemsets is effective because the computation of the subsets is unnecessary according to the Apriori property. Experimental results show that the proposed pruning strategy improves the update efficiency of association rules.