2006Computer Technology and DevelopmentRequires access

An Improvement of Apriori Algorithm for Mining Association Rules

Guangyang Wang

Open publisher page 13 citations

Abstract

Association rule mining can find interesting associations among a large set of data items,and has been applied widely in many fields.But the importance of data items is seldom considered in the traditional association rules which think every data item has the same importance for rules,actually the result of mining is not good.To explore the more valuable rules,present weighted association rule algorithms that is to use frequentness and profit to express the importance,and then improve the classical Apriori algorithms.Finally use the example to testify the improved algorithms that is reasonable and find much more valuable information.

About this research paper

What this paper is about

Association rule mining can find interesting associations among a large set of data items,and has been applied widely in many fields.But the importance of data items is seldom considered in the traditional association rules which think every data item has the same importance for rules,actually the result of mining is not good.To explore the more valuable rules,present weighted association rule algorithms that is to use frequentness and profit to express the importance,and then improve the classical Apriori algorithms.Finally use the example to testify the improved algorithms that is reasonable and find much more valuable information.

Why it matters

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

Association rule mining can find interesting associations among a large set of data items,and has been applied widely in many fields.But the importance of data items is seldom considered in the traditional association rules which think every data item has the same importance for rules,actually the result of mining is not good.To explore the more valuable rules,present weighted association rule algorithms that is to use frequentness and profit to express the importance,and then improve the classical Apriori algorithms.Finally use the example to testify the improved algorithms that is reasonable and find much more valuable information.

Key concepts: Association rule learning, Apriori algorithm, Computer science, Data mining, A priori and a posteriori, Association (psychology), Set (abstract data type), Epistemology

Related papers

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