ScholarLens Back to search
2010•Microcomputer InformationRequires access

A association rules mining algorithm base on compression matrix

Deng Yi-jian

Open publisher page 0 citations

Abstract

Based on fully analyzing the Apriori algorithm of an association rules mining algorithm, this paper present a new association rules mining algorithm based on compression matrix(CMApriori algorithm).This algorithm scans the database only once and utilizes compress techniques , which reduces the memory space of data.It finds frequent itemsets through simple calculation on compression matrix.The result of the experiment shows that CMApriori algorithm with high efficiency than Apriori algorithm.

About this research paper

What this paper is about

Based on fully analyzing the Apriori algorithm of an association rules mining algorithm, this paper present a new association rules mining algorithm based on compression matrix(CMApriori algorithm).This algorithm scans the database only once and utilizes compress techniques , which reduces the memory space of data.It finds frequent itemsets through simple calculation on compression matrix.The result of the experiment shows that CMApriori algorithm with high efficiency than Apriori algorithm.

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

Based on fully analyzing the Apriori algorithm of an association rules mining algorithm, this paper present a new association rules mining algorithm based on compression matrix(CMApriori algorithm).This algorithm scans the database only once and utilizes compress techniques , which reduces the memory space of data.It finds frequent itemsets through simple calculation on compression matrix.The result of the experiment shows that CMApriori algorithm with high efficiency than Apriori algorithm.

Key concepts: Apriori algorithm, Computer science, Association rule learning, Data mining, Algorithm, Compression (physics), GSP Algorithm, Matrix (chemical analysis)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A association rules mining algorithm base on compression matrix — Research Paper | ScholarLens