An Improved Apriori Algorithm Based on Graph

Apriori is classical in association rules mining.The core of the algorithm is a recursive Bottom-up approach based on the frequent theory.An analysis of the Apriori algorithm indicated its some problems in this article,and provides an improvement on Apriori algorithm.The improved algorithm is based on the Top-down thinking.It can compute the candidated itemsets and the count of support of itemsets more quickly by directed graph.It can also simplify the join step and the prune step in Apriori algorithm.Thus the efficiency of Apriori algorithm gets improvement both in time and in space.