2006•Journal of Shenyang Normal UniversityRequires access

An Improved Algorithm for Mining Association Rules

Zhidan Wu

Abstract

It is an important issue to discover association rules from large scale database,the main problem of which is frequent itemset mining.The classical Apriori algorithm is an efficient one for that.Based on analysis of the Apriori algorithm,this paper puts forward an improved algorithm which adopts two-dimension array instead of complex Hash-tree structure to expedite the mining process.

About this research paper

What this paper is about

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

Key concepts: Association rule learning, Apriori algorithm, Data mining, Computer science, Hash function, GSP Algorithm, A priori and a posteriori, Dimension (graph theory)