ScholarLens Back to search
2008•Jisuanji gongcheng yu shejiRequires access

Improved algorithm based on Apriori algorithm

LI Shi-song

Open publisher page 4 citations

Abstract

Mining association rules is one of the most important topics in data mining. In order to mine association rules quickly, the Apriori algorithm is analyzed, and in this foundation one kind of improved algorithm is proposed which is called NApriori algorithm. In order to mine association rules, it used frequent 1 itemset to reorganize the transaction database. It only needed two times of scanning, and had avoided the tedious connection step and the deletion step of the Apriori algorithm. The experiment indicates that this method has a better performance compared to the Apriori algorithm.

About this research paper

What this paper is about

Mining association rules is one of the most important topics in data mining. In order to mine association rules quickly, the Apriori algorithm is analyzed, and in this foundation one kind of improved algorithm is proposed which is called NApriori algorithm. In order to mine association rules, it used frequent 1 itemset to reorganize the transaction database. It only needed two times of scanning, and had avoided the tedious connection step and the deletion step of the Apriori algorithm. The experiment indicates that this method has a better performance compared to the Apriori algorithm.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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 rules is one of the most important topics in data mining. In order to mine association rules quickly, the Apriori algorithm is analyzed, and in this foundation one kind of improved algorithm is proposed which is called NApriori algorithm. In order to mine association rules, it used frequent 1 itemset to reorganize the transaction database. It only needed two times of scanning, and had avoided the tedious connection step and the deletion step of the Apriori algorithm. The experiment indicates that this method has a better performance compared to the Apriori algorithm.

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

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Improved algorithm based on Apriori algorithm — Research Paper | ScholarLens