A New Mining Algorithm of Association Rules and Applications

Abstract

It is an important part of research content in data mining to discover association rules from large scale database, the main problem of which is frequent itemsets mining. The classical Apriori algorithm is an efficient one for that. Aimed at the performance bottlenecks of multiply scanning the database and generating a large quantity of candidate itemsets in Apriori algorithm, an improved algorithm of mining association rules is presented for the bottleneck problem. Filtering out the transactions unconcerned with mining targets by a presupposed filter, on the one hand, the improved Apriori algorithm can compresses database and reduces scanning times; on another hand, the number of candidate itemsets also decreases with it, so the improvement strategy can greatly improves the whole performance of the algorithm. The application of improved Apriori algorithm in traffic accident data mining also shows that it is very practical and efficient in data mining.