288 search results - page 9 / 58 » Estimating the number of frequent itemsets in a large databa... |
159
click to vote
ACTA
2007
15 years 6 months ago
2007
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
167
click to vote
KDD
2008
ACM
16 years 6 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...
148
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
138
click to vote
KDD
1999
ACM
15 years 10 months ago
1999
ACM
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
194
click to vote
KAIS
2008
15 years 6 months ago
2008
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...