200 search results - page 18 / 40 » An Algorithm for In-Core Frequent Itemset Mining on Streamin... |
DAWAK
2006
Springer
14 years 14 days ago
2006
Springer
Many privacy preserving data mining algorithms attempt to selectively hide what database owners consider as sensitive. Specifically, in the association-rules domain, many of these ...
ICDE
2001
IEEE
14 years 10 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
KDD
2010
ACM
14 years 20 days ago
2010
ACM
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
PODS
2004
ACM
14 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...
KDD
2006
ACM
14 years 9 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...