An improved apriori algorithm

Abstract

Association rules mining occupies an important position in data mining. In order to improve the efficiency of mining of frequent itemsets, contrapose the two key problems of reducing the times of scaning the transactional database and reducing the number of candidate item sets, an improved algorithm is presented based on the classic Apriori algorithm. The theoretical analysis and test results show that the improved algorithm is better than Apriori algorithm significantly on efficiency. © 2011 Springer-Verlag.