259 search results - page 18 / 52 » Mining frequent itemsets in time-varying data streams |
95
Voted
DMIN
2006
14 years 11 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
DAMON
2009
Springer
15 years 4 months ago
2009
Springer
We present two efficient Apriori implementations of Frequent Itemset Mining (FIM) that utilize new-generation graphics processing units (GPUs). Our implementations take advantage ...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
PODS
2004
ACM
15 years 9 months ago
2004
ACM
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...