ScholarLens Back to search
2013•International Symposium on Computational Intelligence and DesignRequires access

An Improved Apriori Algorithm Based on Matrix Compression

Tong Liu, Xiaopeng Ji, Yongquan Yang, Wei Zhi-qiang

Open publisher page 2 citations

Abstract

As a classical algorithm using association rules in data mining, the Apriori algorithm has the defect of producing a large number of candidate item sets and scanning the database many times. This paper puts forward an improved MC-Apriori algorithm based on matrix compression, which scans a database and turns it into a Boolean transaction matrix, and then compresses the transaction matrix according to the relevant properties to reduce the amount of computation. The experimental results show that the MC-Apriori algorithm performance has been significantly improved.

About this research paper

What this paper is about

As a classical algorithm using association rules in data mining, the Apriori algorithm has the defect of producing a large number of candidate item sets and scanning the database many times. This paper puts forward an improved MC-Apriori algorithm based on matrix compression, which scans a database and turns it into a Boolean transaction matrix, and then compresses the transaction matrix according to the relevant properties to reduce the amount of computation. The experimental results show that the MC-Apriori algorithm performance has been significantly improved.

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

As a classical algorithm using association rules in data mining, the Apriori algorithm has the defect of producing a large number of candidate item sets and scanning the database many times. This paper puts forward an improved MC-Apriori algorithm based on matrix compression, which scans a database and turns it into a Boolean transaction matrix, and then compresses the transaction matrix according to the relevant properties to reduce the amount of computation. The experimental results show that the MC-Apriori algorithm performance has been significantly improved.

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

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An Improved Apriori Algorithm Based on Matrix Compression — Research Paper | ScholarLens