302 search results - page 11 / 61 » Efficient frequent pattern mining over data streams |
KDD
2006
ACM
15 years 10 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...
AUSAI
2003
Springer
15 years 2 months ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
106
click to vote
ADC
2003
Springer
15 years 2 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
KDD
2010
ACM
15 years 1 months 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...
PAKDD
2010
ACM
14 years 11 months ago
2010
ACM
Mining frequent itemsets from transactional datasets is a well known problem with good algorithmic solutions. In the case of uncertain data, however, several new techniques have be...