Study of Rapid Incremental Updating Algorithm for Association Rule

Rapid incremental updating algorithm makes full use of the results of mining and will get frequent item sets of the item updated data set by scanning the newly-added data set only once without rescanning the original one.The algorithm avoids re-dealing with the data which has been dealt with and repeatedly scanning newly-added data set.Compared with other associating algorithm,it greatly reduces the run-time and improves the mining efficiency.With the enlarging of the historical data set,the superiority will be shown more obvoiusly.And it can also resolve the mining problems of the Apriori algorithm which is due to the too large data set leading to the insufficient memory.And this is equivalent to data set group mining.