An Improvement on Apriori Algorithm
Zhang Zhen-lin
Abstract
Zhang Zhen-lin
Abstract
This paper provides a survey of the study in association rule generation, and on the basis of analyzing theory of mining association rules, analyzes the Apriori algorithm and presents an Apriori-1 algorithm. On the aspect of calculating candidate large item set support degrees concerning record numbers, the new algorithm is less than records numbers in work DB. It improves the efficiency of original algorithm. The Apriori-1 algorithm is practical.
A significance statement is not available in the OpenAlex record.
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 provides a survey of the study in association rule generation, and on the basis of analyzing theory of mining association rules, analyzes the Apriori algorithm and presents an Apriori-1 algorithm. On the aspect of calculating candidate large item set support degrees concerning record numbers, the new algorithm is less than records numbers in work DB. It improves the efficiency of original algorithm. The Apriori-1 algorithm is practical.
Key concepts: Apriori algorithm, Association rule learning, A priori and a posteriori, GSP Algorithm, Computer science, Data mining, Algorithm, Set (abstract data type)