573 search results - page 23 / 115 » Mining Frequent Itemsets from Uncertain Data |
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...
PODS
2004
ACM
14 years 7 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...
ICCS
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...