An Algorithm for Mining Frequent Itemsets

In this paper, we propose a new algorithm for mining frequent itemsets. This algorithm is named AMFI (Algorithm for Mining Frequent Itemsets). This algorithm compresses the data while maintaining the necessary semantics for the frequent itemsets mining problem and it is more efficient that tradition...

Full description

Saved in:
Bibliographic Details
Main Authors: Leon, R.H., Suarez, A.P., Uribe, C.F., Zavaleta, Z.J.G.
Format: Conference Proceeding
Language:English
Subjects:
Astrophysics
Automatic control
Compression algorithms
Dairy products
Data mining
Electronic mail
frequent patterns
Itemsets
Iterative algorithms
Optical computing
Proposals
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we propose a new algorithm for mining frequent itemsets. This algorithm is named AMFI (Algorithm for Mining Frequent Itemsets). This algorithm compresses the data while maintaining the necessary semantics for the frequent itemsets mining problem and it is more efficient that traditional compression algorithms. The AMFI efficiency is based on a compressed vertical binary representation of the data and on a very fast support count. AMFI performs a breadth first search through equivalence classes. We compare our proposal with an implementation using PackBits algorithm.
DOI:10.1109/ICEEE.2008.4723406