An Algorithm for Mining Frequent Itemsets

Raudel Hernandez Leon, Airel Perez Suarez, Claudia Feregrino Uribe, Zobeida Jezabe, Guzman Zavaleta
2008 2008 5th International Conference on Electrical Engineering, Computing Science and Automatic Control  
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
more » ... earch through equivalence classes. We compare our proposal with an implementation using PackBits algorithm.
doi:10.1109/iceee.2008.4723406 fatcat:myohhpmf6vdthbictff5wrfa3q