Fetching the paper…
Reading the bibliography…
We study the problem of online clustering where a clustering algorithm has to assign a new point that arrives to one of $k$ clusters.
Online facility location
Adam Meyerson · 2001
Earlier work this paper cites.
Better streaming algorithms for clustering problems
Moses Charikar, Liadan O’Callaghan, and Rina Panigrahy · 2003
Earlier work this paper cites.
Incremental clustering and dynamic information retrieval
Moses Charikar, Chandra Chekuri, Tomás Feder, and Rajeev Motwani · 2004
Earlier work this paper cites.
Prediction, learning, and games
Nicolo Cesa-Bianchi and Gabor Lugosi · 2006
Earlier work this paper cites.
Cover trees for nearest neighbor
Alina Beygelzimer, Sham Kakade, and John Langford · 2006
Earlier work this paper cites.
Course notes, cse 291: Topics in unsupervised learning. lecture 6: Clustering in an online/streaming setting, 2008
Sanjoy Dasgupta · 2008
Cited alongside, same era.
Ke Chen · 2009
Cited alongside, same era.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Cited alongside, same era.
Online learning and online convex optimization
Shai Shalev-Shwartz et al · 2012
Cited alongside, same era.
Online clustering with experts
Anna Choromanska and Claire Monteleoni · 2012
Cited alongside, same era.
The hardness of approximation of euclidean k-means
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, and Ali Kemal Sinop · 2015
Later among the works it cites.
An algorithm for online k-means clustering
Edo Liberty, Ram Sriharsha, and Maxim Sviridenko · 2016
Later among the works it cites.
A quasi-Bayesian perspective to online clustering
Le Li, Benjamin Guedj, and Sébastien Loustau · 2018
Later among the works it cites.
Unexpected effects of online k-means clustering
Michal Moshkovitz · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…