Speeding up k-means by approximating Euclidean distances via block vectors

Thomas Bottesch, Thomas Bühler, Markus Kächele. Speeding up k-means by approximating Euclidean distances via block vectors. In Maria-Florina Balcan, Kilian Q. Weinberger, editors, Proceedings of the 33nd International Conference on Machine Learning, ICML 2016, New York City, NY, USA, June 19-24, 2016. Volume 48 of JMLR Workshop and Conference Proceedings, pages 2578-2586, JMLR.org, 2016. [doi]

@inproceedings{BotteschBK16,
  title = {Speeding up k-means by approximating Euclidean distances via block vectors},
  author = {Thomas Bottesch and Thomas Bühler and Markus Kächele},
  year = {2016},
  url = {http://jmlr.org/proceedings/papers/v48/bottesch16.html},
  researchr = {https://researchr.org/publication/BotteschBK16},
  cites = {0},
  citedby = {0},
  pages = {2578-2586},
  booktitle = {Proceedings of the 33nd International Conference on Machine Learning, ICML 2016, New York City, NY, USA, June 19-24, 2016},
  editor = {Maria-Florina Balcan and Kilian Q. Weinberger},
  volume = {48},
  series = {JMLR Workshop and Conference Proceedings},
  publisher = {JMLR.org},
}