1. Arthur, D., Vassilvitskii, S.: $$k$$-Means++: the advantages of careful seeding. In: Proceedings of 18th Annual SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, LA, pp. 1027–1035. Society for Industrial and Applied Mathematics, Philadelphia (2007)
2. Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, New York (1981)
3. Drake, J.: Faster $$k$$-means clustering, Master’s thesis, Baylor University, Waco, TX, USA (2013)
4. Ding, Y., Zhao, Y., Shen, Y., Musuvathi, M., Mytkowicz, T.: YinYang $$k$$-means: a drop-in replacement of the classic $$k$$-means with consistent speedup. In: Proceedings of 32nd International Conference on Machine Learning, ICML 2015, Lille, France, JMLR Workshop and Conference Proceedings, vol. 37, pp. 579–587 (2015)
5. Elkan, C.: Using the triangle inequality to accelerate $$k$$-means. Proceedings 20th International Conference on Machine Learning. ICML 2003, Washington, DC, pp. 147–153. AAAI Press, Menlo Park (2003)