LCM ver.3: Collaboration of Array, Bitmap and Pre x Tree for Frequent Itemset Mining

Abstract

ABSTRACT For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. To find all the frequent itemsets, the heaviest task is the computation of frequency of each candidate itemset. In the previous studies, there are roughly three data structures and algorithms for the computation: bitmap, prefix tree… (More)

Topics

7 Figures and Tables

Cite this paper

@inproceedings{Uno2005LCMVC, title={LCM ver.3: Collaboration of Array, Bitmap and Pre x Tree for Frequent Itemset Mining}, author={Takeaki Uno and Masashi Kiyomi and Hiroki Arimura}, year={2005} }