2004Journal of Guangxi Normal UniversityRequires access

AN IMPROVED APRIORI ALGORITHM BY REORDERING ITEMSETS

Meiling Liu

Open publisher page 2 citations

Abstract

The Apriori algorithm is a classical algorithm for mining association rules.In this paper,we deeply study the idea of the Apriori algorithm,and present an improved algorithm by reordering itemsets,called ImpApri.The number of candidate itemsets can be largely reduced,and its efficiency is higher than that of the original Apriori algorithm.

About this research paper

What this paper is about

The Apriori algorithm is a classical algorithm for mining association rules.In this paper,we deeply study the idea of the Apriori algorithm,and present an improved algorithm by reordering itemsets,called ImpApri.The number of candidate itemsets can be largely reduced,and its efficiency is higher than that of the original Apriori algorithm.

Why it matters

OpenAlex reports 2 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

The Apriori algorithm is a classical algorithm for mining association rules.In this paper,we deeply study the idea of the Apriori algorithm,and present an improved algorithm by reordering itemsets,called ImpApri.The number of candidate itemsets can be largely reduced,and its efficiency is higher than that of the original Apriori algorithm.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
AN IMPROVED APRIORI ALGORITHM BY REORDERING ITEMSETS — Research Paper | ScholarLens