VLDB
2010
ACM
13 years 10 months ago
2010
ACM
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
MLDM
2008
Springer
14 years 12 days ago
2008
Springer
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
KDD
2010
ACM
14 years 4 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...
INAP
2001
Springer
14 years 4 months ago
2001
Springer
This paper presents new techniques for focusing the discoveryof frequent itemsets within large, dense datasets containing highly frequent items. The existence of highly frequent i...
SSDBM
2008
IEEE
14 years 6 months ago
2008
IEEE
Abstract. We present novel space and time-efficient algorithms for finding frequent items over general update streams. Our algorithms are based on a novel adaptation of the popula...
PODS
2003
ACM
15 years 17 days ago
2003
ACM
SIGMOD
2005
ACM
15 years 18 days ago
2005
ACM
Existing energy-efficient approaches to in-network aggregation in sensor networks can be classified into two categories, tree-based and multi-path-based, with each having unique s...