Improvement of Apriori algorithm for association rules
Canbing Li
Abstract
Canbing Li
Abstract
Based on the analysis of principle and efficiency on Apriori algorithm, this paper points out its defects and presents an improved Apriori algorithm. The new algorithm can decrease the I/O operation of the process of mining by means of decreasing the times of database searching. It is shown by the experimental result that the improved algorithm is much more efficient than the traditional algorithm in being applied to mining association rule.
OpenAlex reports 2 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.
Based on the analysis of principle and efficiency on Apriori algorithm, this paper points out its defects and presents an improved Apriori algorithm. The new algorithm can decrease the I/O operation of the process of mining by means of decreasing the times of database searching. It is shown by the experimental result that the improved algorithm is much more efficient than the traditional algorithm in being applied to mining association rule.
Key concepts: Apriori algorithm, Association rule learning, GSP Algorithm, Data mining, A priori and a posteriori, Computer science, Process (computing), Algorithm