[33] Charles Elkan. Using the triangle inequality to accelerate k-means. In Proceedings of the Twentieth International Conference on International Conference on Machine Learning, ICML'03, page 147-153. AAAI Press, 2003.
[34] Martin Ester, Hans-Peter Kriegel, Jörg Sander, and Xiaowei Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, KDD'96, page 226-231. AAAI Press, 1996.
[35] Dan Feldman. Introduction to core-sets: an updated survey. arXiv preprint arXiv:2011.09384, 2020.
[36] Dan Feldman and Michael Langberg. A unified framework for approximating and clustering data. In Proceedings of the forty-third annual ACM symposium on Theory of computing, pages 569-578, 2011.
[37] Dan Feldman, Melanie Schmidt, and Christian Sohler. Turning big data into tiny data: Constant-size coresets for k-means, pca, and projective clustering. SIAM Journal on Computing, 49(3):601-657, 2020.
[38] Zachary Friggstad, Mohsen Rezapour, and Mohammad R. Salavatipour. Local search yields a ptas for k-means in doubling metrics. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pages 365-374, 2016.
[39] Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, and Rakesh Venkat. A refined approximation for Euclidean k-means. Inf. Process. Lett., 176(C), jun 2022.
[40] Greg Hamerly. Making k-means even faster. In Proceedings of the 2010 SIAM international conference on data mining, pages 130-140. SIAM, 2010.
[41] Sariel Har-Peled and Soham Mazumdar. On coresets for k-means and k-median clustering. In Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, STOC '04, page 291–300, New York, NY, USA, 2004. Association for Computing Machinery.
[42] Oktie Hassanzadeh, Fei Chiang, Hyun Chul Lee, and Renee J. Miller. Framework for evaluating clustering algorithms in duplicate detection. Proc. VLDB Endow., 2(1):1282-1293, aug 2009.
[43] Jennifer Jang and Heinrich Jiang. Dbscan++: Towards fast and scalable density clustering. In International conference on machine learning, pages 3019-3029. PMLR, 2019.
[44] Herve Jegou, Matthijs Douze, and Cordelia Schmid. Product quantization for nearest neighbor search. IEEE transactions on pattern analysis and machine intelligence, 33(1):117-128, 2010.
[45] T. Kanungo, D.M. Mount, N.S. Netanyahu, C.D. Piatko, R. Silverman, and A.Y. Wu. An efficient k-means clustering algorithm: analysis and implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(7):881-892, 2002.
[46] Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine Piatko, Ruth Silverman, and Angela Y. Wu. The analysis of a simple k-means clustering algorithm. In Proceedings of the Sixteenth Annual Symposium on Computational Geometry, SCG '00, page 100-109, New York, NY, USA, 2000. Association for Computing Machinery.
[47] 2004 KDD Cup. Protein homology dataset. available at https://osmot.cs.cornell.edu/kddcup/datasets.html, 2004.
[48] Stavros G. Kolliopoulos and Satish Rao. A nearly linear-time approximation scheme for the Euclidean k-median problem. In Jaroslav Nešetřil, editor, Algorithms - ESA' 99, pages 378-389, Berlin, Heidelberg, 1999. Springer Berlin Heidelberg.
[49] Silvio Lattanzi and Christian Sohler. A better k-means++ algorithm via local search. In Kamalika Chaudhuri and Ruslan Salakhutdinov, editors, Proceedings of the 36th International Conference on Machine Learning, volume 97 of Proceedings of Machine Learning Research, pages 3662-3671. PMLR, 09-15 Jun 2019.