Sciweavers

FIMI
2003
146views Data Mining» more  FIMI 2003»
13 years 6 months ago
Mining Frequent Itemsets using Patricia Tries
We present a depth-first algorithm, PatriciaMine, that discovers all frequent itemsets in a dataset, for a given support threshold. The algorithm is main-memory based and employs...
Andrea Pietracaprina, Dario Zandolin
DCC
2000
IEEE
13 years 9 months ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...