Fetching the paper…
Reading the bibliography…
We explore clustering problems in the streaming sliding window model in both general metric spaces and Euclidean space.
Decomposable searching problems i: Static-to-dynamic transformation
J.L. Bentley and J.B. Saxe · 1980
Earlier work this paper cites.
The space complexity of approximating the frequency moments
N. Alon, Y. Matias, and M. Szegedy · 1999
Earlier work this paper cites.
Primal-dual approximation algorithms for metric facility location and k k -median problems
K. Jain and V. Vazirani · 1999
Earlier work this paper cites.
The Probabilistic Method
N. Alon and J. Spencer · 2000
Earlier work this paper cites.
Clustering data streams
S. Guha, N. Mishra, R. Motwani, and L. O’Callaghan · 2000
Earlier work this paper cites.
Online facility location
A. Meyerson · 2001
Earlier work this paper cites.
Maintaining stream statistics over sliding windows
M. Datar, A. Gionis, P. Indyk, and R. Motwani · 2002
Earlier work this paper cites.
Maintaining variance and k-medians over data stream windows
B. Babcock, M. Datar, R. Motwani, and L. O’Callaghan · 2003
Earlier work this paper cites.
Better streaming algorithms for clustering problems
M. Charikar, L. O’Callaghan, and R. Panigrahy · 2003
Earlier work this paper cites.
Approximating extent measures of points
P. K. Agarwal, S. Har-Peled, and K.R. Varadarajan · 2004
Earlier work this paper cites.
Local search heuristics for k k -median and facility location problems
V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit · 2004
Earlier work this paper cites.
Coresets for k k -means and k k -median clustering and their applications
S. Har-Peled and S. Mazumdar · 2004
Earlier work this paper cites.
Algorithms for dynamic geometric problems over data streams
P. Indyk · 2004
Cited alongside, same era.
An improved data stream summary: the count-min sketch and its applications
G. Cormode and S. Muthukrishnan · 2005
Cited alongside, same era.
What’s new: finding significant differences in network data streams
G. Cormode and S. Muthukrishnan · 2005
Cited alongside, same era.
Coresets in dynamic geometric data streams
G. Frahling and C. Sohler · 2005
Cited alongside, same era.
Smaller coresets for k k -median and k k -means clustering
S. Har-Peled and A. Kushal · 2005
Cited alongside, same era.
Data streams: Algorithms and applications
S. Muthukrishnan · 2005
Cited alongside, same era.
Coresets and sketches for high dimensional subspace problems
D. Feldman, M. Monemizadeh, C. Sohler, and D. Woodruff · 2010
Later among the works it cites.
Non-uniform sampling in clustering and streaming
M. Monemizadeh · 2010
Later among the works it cites.
Streaming k-means on well-clusterable data
Vladimir Braverman, Adam Meyerson, Rafail Ostrovsky, Alan Roytman, Michael Shindler, and Brian Tagiku · 2011
Later among the works it cites.
A unified framework for approximating and clustering data
D. Feldman and M. Langberg · 2011
Later among the works it cites.
Geometric Approximation Algorithms
S. Har-Peled · 2011
Later among the works it cites.
k k -median clustering, model-based compressive sensing, and sparse recovery for earth mover distance
P. Indyk and E. Price · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Coresets for weighted facilities and their applications
D. Feldman, A. Fiat, and M. Sharir · 2006
Cited alongside, same era.
Smooth histograms on sliding windows
Vladimir Braverman and Rafail Ostrovsky · 2007
Cited alongside, same era.
A PTAS for k-means clustering based on weak coresets
D. Feldman, M. Monemizadeh, and C. Sohler · 2007
Cited alongside, same era.
Streaming in a connected world: querying and tracking distributed data streams
G. Cormode and M. N. Garofalakis · 2008
Cited alongside, same era.
On coresets for k k -median and k k -means clustering in metric and Euclidean spaces and their applications
K. Chen · 2009
Cited alongside, same era.
Effective computations on sliding windows
V. Braverman and R. Ostrovsky · 2010
Cited alongside, same era.
Optimal sampling from sliding windows
V. Braverman, R. Ostrovsky, and C. Zaniolo · 2012
Later among the works it cites.
Element distinctness, frequency moments, and sliding windows
P. Beame, R. Clifford, and W. Machmouchi · 2013
Later among the works it cites.
The continuous distributed monitoring model
G. Cormode · 2013
Later among the works it cites.
Dynamic graphs in the sliding-window model
M. S. Crouch, A. McGregor, and D. Stubbs · 2013
Later among the works it cites.
( 1 + ε ) (1+\varepsilon) -approximation for facility location in data streams
A. Czumaj, C. Lammersen, M. Monemizadeh, and C. Sohler · 2013
Later among the works it cites.
Real-time detection, tracking and monitoring of automatically discovered events in social media
M. Osborne, S. Moran, R. McCreadie, A. Von Lunen, M. Sykora, E. Cano, N. Ireson, C. MacDonald, I. Ounis, Y. He, T. Jackson, F. Ciravegna, and A. O’Brien · 2014
Later among the works it cites.