85 search results - page 10 / 17 » An Efficient Algorithm for Maintaining Frequent Closed Items... |
196
click to vote
ICDE
2012
IEEE
14 years 3 months ago
2012
IEEE
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
280
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
162
Voted
DASFAA
2010
IEEE
15 years 2 months ago
2010
IEEE
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream a...
148
Voted
PODC
2006
ACM
15 years 10 months ago
2006
ACM
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
131
click to vote
MLDM
2008
Springer
15 years 4 months 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...