179 search results - page 4 / 36 » An Approximate Approach for Mining Recently Frequent Itemset... |
PKDD
2007
Springer
14 years 2 months ago
2007
Springer
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
KDD
2009
ACM
14 years 3 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
2009
ACM
14 years 9 months ago
2009
ACM
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
DAWAK
2010
Springer
13 years 10 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...