2018DEStech Transactions on Computer Science and EngineeringOpen access

Improved Apriori Algorithm for Mining Association Rules

Yu-gang DAI, Xiang Zhang, Tao Xu, Lin Ye, Yajing Ma

Open full text 0 citations

Abstract

Apriori algorithm as a classic algorithm in data mining, it has a good performance in a small number of transactions in the database which has been widely used by people, but the algorithm has two inherent flaws, affect the efficiency of Apriori algorithm mining information in large database. Aiming at the Bottleneck Problem Restricting the Efficiency of Apriori Algorithm, in this paper, two inherent flaws of Apriori algorithm are improved, in order to improve Apriori algorithm in large database mining efficiency. The algorithm reduces the number of connections and the number of database scan to shorten the database scan time. Experimental results show, the optimized Apriori algorithm has some improvements in operation efficiency.

About this research paper

What this paper is about

Apriori algorithm as a classic algorithm in data mining, it has a good performance in a small number of transactions in the database which has been widely used by people, but the algorithm has two inherent flaws, affect the efficiency of Apriori algorithm mining information in large database. Aiming at the Bottleneck Problem Restricting the Efficiency of Apriori Algorithm, in this paper, two inherent flaws of Apriori algorithm are improved, in order to improve Apriori algorithm in large database mining efficiency. The algorithm reduces the number of connections and the number of database scan to shorten the database scan time. Experimental results show, the optimized Apriori algorithm has some improvements in operation efficiency.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Apriori algorithm as a classic algorithm in data mining, it has a good performance in a small number of transactions in the database which has been widely used by people, but the algorithm has two inherent flaws, affect the efficiency of Apriori algorithm mining information in large database. Aiming at the Bottleneck Problem Restricting the Efficiency of Apriori Algorithm, in this paper, two inherent flaws of Apriori algorithm are improved, in order to improve Apriori algorithm in large database mining efficiency. The algorithm reduces the number of connections and the number of database scan to shorten the database scan time. Experimental results show, the optimized Apriori algorithm has some improvements in operation efficiency.

Key concepts: Apriori algorithm, Association rule learning, GSP Algorithm, Computer science, Data mining, Bottleneck, A priori and a posteriori, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Improved Apriori Algorithm for Mining Association Rules — Research Paper | ScholarLens