A Study of Improving Apriori Algorithm

Abstract

The Apriori algorithm is one of the most influential apriori for mining association rules. The basic idea of the Apriori algorithm is to identify all the frequent sets. Through the frequent sets, derived association rules, these rules must satisfy minimum support threshold and minimum confidence threshold. This paper presents improved algorithms, mainly through the introduction of interest items, frequency threshold, to improve the mining efficiency, dynamic data mining to facilitate the needs of users. Confirmed by many experiments, this algorithm is better than traditional algorithms in time and space complexity.