Incremental updating algorithm for mining association rules

Zhao Ji · Systems engineering and electronics · 2004

To update original association rules when a new transaction database is added to the original database and the minimum support threshold and minimum confidence threshold are kept unchanged, a simple and high-efficiency incremental updating algorithm for mining association rules is presented. Using the set method, a transaction database is divided into two sets, one is frequent itemset and the other is infrequent itemset. Accordingly, the set of frequent itemset can be discovered accurately in the possible relationship between two transaction databases. Based on this, a new association rule can be got easily by using the given algorithm. In the end, the superiority of this algorithm is analyzed.\;

Read the paper · More papers on PaperTik