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

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, and… (More)
DOI: 10.1145/1133905.1133916

Topics

7 Figures and Tables

Statistics

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

146 Citations

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

See our FAQ for additional information.

Slides referencing similar topics