LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining

@inproceedings{Uno2005LCMVC,
  title={LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining},
  author={Takeaki Uno and Masashi Kiyomi and Hiroki Arimura},
  year={2005}
}
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, and array lists. Each of these has its own advantage and disadvantage with respect to the density of the input database. In this paper, we propose… CONTINUE READING
Highly Influential
This paper has highly influenced 22 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 170 citations. REVIEW CITATIONS

7 Figures & Tables

Topics

Statistics

01020'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

171 Citations

Semantic Scholar estimates that this publication has 171 citations based on the available data.

See our FAQ for additional information.