Author:
Li Min,Xu Dachuan,Yue Jun,Zhang Dongmei,Zhang Peng
Funder
Higher Educational Science and Technology Program of Shandong Province
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference21 articles.
1. Aggarwal A, Deshpande A, Kannan R (2009) Adaptive sampling for $$k$$-means clustering. In: Proceedings of APPROX and RANDOM, pp. 15–28
2. Ahmadian S, Norouzi-Fard A, Svensson O, Ward J (2017) Better guarantees for $$k$$-means and Euclidean $$k$$-median by primal–dual algorithms. In: Proceedings of FOCS, pp. 61–72
3. Aloise D, Deshpande A, Hansen P, Popat P (2009) NP-hardness of Euclidean sum-of-squares clustering. Mach Learn 75:245–248
4. Arthur D, Vassilvitskii S (2007) $$k$$-means++: The advantages of careful seeding. In: Proceedings of SODA, pp. 1027–1035
5. Awasthi P, Charikar M, Krishnaswamy R, Sinop AK (2015) The hardness of approximation of Euclidean $$k$$-means. In: Proceedings of SoCG, pp. 754–767
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Energy-efficient offloading based on hybrid bio-inspired algorithm for edge–cloud integrated computation;Sustainable Computing: Informatics and Systems;2024-04
2. A network model based on scrap metal classification and grading;International Conference on Computer Graphics, Artificial Intelligence, and Data Processing (ICCAID 2023);2024-03-27
3. Factor Analysis-Based Method for Clustering Taxi Zones;2023 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI);2023-12-11
4. An Approximation Algorithm Based on Seeding Algorithm for Fuzzy k-Means Problem with Penalties;Journal of the Operations Research Society of China;2022-05-21
5. Effective Heuristic Techniques for Combined Robust Clustering Problem;Asia-Pacific Journal of Operational Research;2022-02-07