2008Computer Technology and DevelopmentRequires access

An Improvement on Apriori Algorithm

Mingqing Zhai

Open publisher page 0 citations

Abstract

The many interesting relations and relevance between the different items of sets can be located by means of the association rules mining technique of data mining.The mining of association rules from databases becomes especially necessary with the data in collection and storation becomes even larger.However,an analysis of the association rules mining technique and its relevant algorithm of Apriori has indicated that there exist problems in the technique in discussion.Apriori algorithm is classical in association rules mining.Provides an improvement on Apriori algorithm.It can compute the count of support of itemsets more quickly by 0-1 matrix.It can also simplify the join step and the prune step in Apriori algorithm.Thus the efficiency of Apriori algorithm get improvement both in time and in space.

About this research paper

What this paper is about

The many interesting relations and relevance between the different items of sets can be located by means of the association rules mining technique of data mining.The mining of association rules from databases becomes especially necessary with the data in collection and storation becomes even larger.However,an analysis of the association rules mining technique and its relevant algorithm of Apriori has indicated that there exist problems in the technique in discussion.Apriori algorithm is classical in association rules mining.Provides an improvement on Apriori algorithm.It can compute the count of support of itemsets more quickly by 0-1 matrix.It can also simplify the join step and the prune step in Apriori algorithm.Thus the efficiency of Apriori algorithm get improvement both in time and in space.

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

The many interesting relations and relevance between the different items of sets can be located by means of the association rules mining technique of data mining.The mining of association rules from databases becomes especially necessary with the data in collection and storation becomes even larger.However,an analysis of the association rules mining technique and its relevant algorithm of Apriori has indicated that there exist problems in the technique in discussion.Apriori algorithm is classical in association rules mining.Provides an improvement on Apriori algorithm.It can compute the count of support of itemsets more quickly by 0-1 matrix.It can also simplify the join step and the prune step in Apriori algorithm.Thus the efficiency of Apriori algorithm get improvement both in time and in space.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
An Improvement on Apriori Algorithm — Research Paper | ScholarLens