An Improved Apriori Algorithm for Mining Association Rules

Association rule mining is an important part of research content in data mining.In order to efficiently and quickly mine all frequent itemset from the transaction database,an improved algorithm of mining association rules is presented for the bottleneck problem of the classic Apriori algorithm.The transaction database is mapped to Bool array,then all the operations are carried out based on array elements value,thereby reducing the database scanning frequency.Then use bitwiseAND operation and random access characteristics of array,a direct consequence of frequent itemsets,rather than have a large number of candidate sets,thereby improving the efficiency of the algorithm.