Funder
Natural Science Foundation of Shandong Province
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Reference19 articles.
1. Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245–248 (2009)
2. Ahmadian, S., Norouzi-Fard, A., Svensson, O., Ward, J.: Better guarantees for $$k$$-means and Euclidean $$k$$-median by primal-dual algorithms. In: Proceedings of Foundations of Computer Science. pp. 61–72 (2017)
3. Lloyd, S.P.: Least squares quantization in PCM’s. IEEE Trans. Inf. Theory 28(2), 129–137 (1982)
4. Arthur, D., Vassilvitskii, S.: $$k$$-means++: the advantages of careful seeding. In: Proceedings of Symposium on Discrete Algorithms. pp. 1027–1035 (2007)
5. Ji, S., Xu, D.C., Guo, L.K., Li, M., Zhang, D.M.: The seeding algorithm for spherical $$k$$-means clustering with penalties. J. Comb. Opt. (2020). https://doi.org/10.1007/s10878-020-00569-1