Learn More

This paper shows that one can be competitive with the k-means objective while operating online. In this model, the algorithm receives vectors v 1 ,. .. , v n one by one in an arbitrary order. For each vector v t the algorithm outputs a cluster identifier before receiving v t+1. Our online algorithm generates˜O(k) clusters whose k-means cost is˜O(W *) where… (More)

- ‹
- 1
- ›