Algorithms for mining frequent itemsets in static and dynamic datasets
Raudel Hernández-León, José Hernández-Palancar, Jesús Ariel Carrasco-Ochoa, José Fco. Martínez-Trinidad · Intelligent Data Analysis · 2010
In this paper, two algorithms for mining frequent itemsets in large sparse datasets are proposed. The first one, named Compressed Arrays (CA), allows to process datasets that do not change along the time (static datasets) while the second one, based