2010Microcomputer InformationRequires access

An Improved Algorithm for Association Rules Mining Based on Reducing Transaction

Yanqi Xie

Open publisher page 0 citations

Abstract

Mining association rule is an important task in data mining research field, its purpose is to mine associations in transaction database. Apriori algorithm is a classical algorithm for mining association rule, due to the algorithm need to be repeated scanning the database, and it has less efficiency. Based on the study of principle and efficiency of the Apriori algorithm, this paper proposes an improved strategy based on reducing transaction to optimize the Apriori algorithm,the analysis and comparison is carried out between it and the Apriori algorithm. The experimental result shown that the improved algorithm has a more significant performance than the Apriori algorithm.

About this research paper

What this paper is about

Mining association rule is an important task in data mining research field, its purpose is to mine associations in transaction database. Apriori algorithm is a classical algorithm for mining association rule, due to the algorithm need to be repeated scanning the database, and it has less efficiency. Based on the study of principle and efficiency of the Apriori algorithm, this paper proposes an improved strategy based on reducing transaction to optimize the Apriori algorithm,the analysis and comparison is carried out between it and the Apriori algorithm. The experimental result shown that the improved algorithm has a more significant performance than the Apriori algorithm.

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

Mining association rule is an important task in data mining research field, its purpose is to mine associations in transaction database. Apriori algorithm is a classical algorithm for mining association rule, due to the algorithm need to be repeated scanning the database, and it has less efficiency. Based on the study of principle and efficiency of the Apriori algorithm, this paper proposes an improved strategy based on reducing transaction to optimize the Apriori algorithm,the analysis and comparison is carried out between it and the Apriori algorithm. The experimental result shown that the improved algorithm has a more significant performance than the Apriori algorithm.

Key concepts: Apriori algorithm, Association rule learning, Computer science, Database transaction, GSP Algorithm, Data mining, A priori and a posteriori, Field (mathematics)

Related papers

Back to paper searchBrowse research topicsOriginal source
An Improved Algorithm for Association Rules Mining Based on Reducing Transaction — Research Paper | ScholarLens