Fast Frequent Itemset Mining using Compressed Data Representation

Explore this paper's citation graph

Summary

This paper describes a more efficient algorithm for mining complete frequent itemsets from typical data sets using a compressed prefix tree and presents performance comparisons of the algorithm against the fastest Apriori algorithm, Eclat, and FP-Growth.

Type
article
Published
2003-01-01
Cited by
13
References
7

Keywords

Association rule learning, Computer science, Data mining, Apriori algorithm, Database transaction

References

Cited by

Related papers