Abstract:

At present, lots of algorithms for mining association rules and theil- mutations are proposed. One of them is the most famous Apriori algorithm, but t raditional algorithms are not efficient. In this paper, a new algorithm for fast updating is proposed to solve the above problems.

Key words: data mining;association rule, frequent item set;Apriori algorithm