Author:
Li Min,Xu Dachuan,Zhang Dongmei,Zou Juan
Funder
Higher Educational Science and Technology Program of Shandong Province
Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications
Reference21 articles.
1. Ackermann, M.R.: Algorithms for the Bregman $$k$$-Median Problem. In: Ph.D. Thesis, University of Paderborn (2009)
2. Aggarwal, A., Deshpande, A., Kannan, R.: Adaptive sampling for $$k$$-means clustering. In: Proceedings of APPROX and RANDOM, pp. 15–28 (2009)
3. 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 FOCS, pp. 61–72 (2017)
4. Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75, 245–248 (2009)
5. Arthur, D., Vassilvitskii, S.: $$k$$-means++: The advantages of careful seeding. In: Proceedings of SODA, pp. 1027–1035 (2007)
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献