One Optimized Method of Apriori Algorithm
Qian Guang-chao
Abstract
Qian Guang-chao
Abstract
This paper introduces the principle and efficiency of the Apriori algorithm which is the classical algorithm of association rules mining,and proposes an improved Apriori algorithm――En-Apriori algorithm which is aimed at the disadvantage of Apriori algorithm.This algorithm adopts a matrix method and need scan the database only once and optimizes the join operation,so it is more efficient.The experiment shows that the En-Apriori algorithm outperforms Apriori algorithm,and gets a good practicality.
OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper introduces the principle and efficiency of the Apriori algorithm which is the classical algorithm of association rules mining,and proposes an improved Apriori algorithm――En-Apriori algorithm which is aimed at the disadvantage of Apriori algorithm.This algorithm adopts a matrix method and need scan the database only once and optimizes the join operation,so it is more efficient.The experiment shows that the En-Apriori algorithm outperforms Apriori algorithm,and gets a good practicality.
Key concepts: Apriori algorithm, Computer science, Association rule learning, A priori and a posteriori, GSP Algorithm, Data mining, Algorithm, Epistemology