An Improved Apriori Algorithm Based on Transaction Sequence Counting

Apriori algorithm has the advantages of simplicity and easy realization, which can realize the search for some association between data. However, it also has unavoidable flaws. The traditional serial Apriori algorithm has the disadvantages of frequent scanning database, generating large amount of candidate item-set data and consuming a lot of memory resources. This paper proposes some technologies based on association principle, and proposes an improved Apriori algorithm to overcome the shortcomings of Apriori algorithm. When dealing with transactions, the algorithm filters out transactions that cannot generate frequent item-set, which can greatly reduce the amount of data processing. Theoretical analysis and experimental results show that the proposed scheme has the best performance in efficiency and stability.