109 search results - page 5 / 22 » A Thorough Experimental Study of Datasets for Frequent Items... |
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
We study the problem of finding frequent itemsets in a continuous stream of transactions. The current frequency of an itemset in a stream is defined as its maximal frequency ove...
KDD
2006
ACM
14 years 8 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...
FIMI
2004
13 years 9 months ago
2004
We present AIM2-F, an improved implementation of AIM-F [4] algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the e...
KDD
2009
ACM
14 years 2 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
KDD
2008
ACM
14 years 8 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...