DMCA
An Algorithm for Mining Frequent Itemsets (2008)
| Venue: | 5TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, COMPUTING SCIENCE AND AUTOMATIC CONTROL (CCE 2008) |
BibTeX
@MISC{León08analgorithm,
author = {Raudel Hernández León and Airel Pérez Suárez and Claudia Feregrino Uribe and Zobeida Jezabel Guzmán Zavaleta},
title = { An Algorithm for Mining Frequent Itemsets},
year = {2008}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
