Fetching the paper…
Reading the bibliography…
We study the sample-based k-median clustering objective under a sequential setting without substitutions.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1963
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Y. LeCun, L. Bottou, Y. Bengio, P. Haffner, et al · 1998
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.
Stability and generalization
O. Bousquet and A. Elisseeff · 2002
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.
Stability-based validation of clustering solutions
T. Lange, V. Roth, M. L. Braun, and J. M. Buhmann · 2004
Earlier work this paper cites.
Online analysis of community evolution in data streams
C. C. Aggarwal and P. S. Yu · 2005
Earlier work this paper cites.
Unsupervised anomaly detection in network intrusion detection using clusters
K. Leung and C. Leckie · 2005
Earlier work this paper cites.
Video summarization by k-medoid clustering
Y. Hadi, F. Essannouni, and R. O. H. Thami · 2006
Earlier work this paper cites.
Medical image segmentation using k-means clustering and improved watershed algorithm
H. Ng, S. Ong, K. Foong, P. Goh, and W. Nowinski · 2006
Earlier work this paper cites.
A knapsack secretary problem with applications
M. Babaioff, N. Immorlica, D. Kempe, and R. Kleinberg · 2007
Earlier work this paper cites.
A framework for statistical clustering with constant time approximation algorithms for k-median and k-means clustering
S. Ben-David · 2007
Cited alongside, same era.
Non-metric affinity propagation for unsupervised image categorization
D. Dueck and B. J. Frey · 2007
Cited alongside, same era.
Performance of recommendation systems in dynamic streaming environments
O. Nasraoui, J. Cerwinske, C. Rojas, and F. Gonzalez · 2007
Cited alongside, same era.
Online auctions and generalized secretary problems
M. Babaioff, N. Immorlica, D. Kempe, and R. Kleinberg · 2008
Cited alongside, same era.
Personalized recommendation in social tagging systems using hierarchical clustering
A. Shepitsen, J. Gemmell, B. Mobasher, and R. Burke · 2008
Cited alongside, same era.
Streaming k-means approximation
N. Ailon, R. Jaiswal, and C. Monteleoni · 2009
Clustering oligarchies
M. Ackerman, S. Ben-David, D. Loker, and S. Sabato · 2013
Later among the works it cites.
Streaming submodular maximization: Massive data summarization on the fly
A. Badanidiyuru, B. Mirzasoleiman, A. Karbasi, and A. Krause · 2014
Later among the works it cites.
New frameworks for offline and streaming coreset constructions
V. Braverman, D. Feldman, and H. Lang · 2016
Later among the works it cites.
An algorithm for online k-means clustering
E. Liberty, R. Sriharsha, and M. Sviridenko · 2016
Later among the works it cites.
UCI machine learning repository, 2017
D. Dua and C. Graff · 2017
Later among the works it cites.
Submodular secretary problems: Cardinality, matching, and linear constraints
T. Kesselheim and A. Tönnis · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications
K. Chen · 2009
Cited alongside, same era.
Empirical bernstein bounds and sample variance penalization
A. Maurer and M. Pontil · 2009
Cited alongside, same era.
Submodular secretary problem and extensions
M. Bateni, M. Hajiaghayi, and M. Zadimoghaddam · 2010
Cited alongside, same era.
Improved competitive ratios for submodular secretary problems
M. Feldman, J. S. Naor, and R. Schwartz · 2011
Cited alongside, same era.
Scikit-learn: Machine learning in Python
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay · 2011
Cited alongside, same era.
Streamkm++: A clustering algorithm for data streams
M. R. Ackermann, M. Märtens, C. Raupach, K. Swierkot, C. Lammersen, and C. Sohler · 2012
Cited alongside, same era.
Later among the works it cites.
Consistent k-clustering
S. Lattanzi and S. Vassilvitskii · 2017
Later among the works it cites.
Online facility location against at-bounded adversary
H. Lang · 2018
Later among the works it cites.
Interactive algorithms: Pool, stream and precognitive stream
S. Sabato and T. Hess · 2018
Later among the works it cites.
PyClustering: Data mining library
A. Novikov · 2019
Closest in time.
Birch: A new data clustering algorithm and its applications
T. Zhang, R. Ramakrishnan, and M. Livny · 2020
Closest in time.