Funder
National Natural Science Foundation of China
Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference18 articles.
1. 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 the 58th annual symposium on foundations of computer science (FOCS), pp 61–72
2. Arthur D, Vassilvitskii S (2007) $$k$$-means++: the advantages of careful seeding. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms (SODA), pp 1027–1035
3. Choo D, Grunau C, Portmann J, Rozhon V (2020) $$k$$-means++: few more steps yield constant approximation. In: Proceedings of the 37th international conference on machine learning (ICML)
4. Dhillon I, Modha D (2001) Concept decompositions for large sparse text data using clustering. Mach Learn 42(1):143–175
5. Endo Y, Miyamoto S (2015) Spherical $$k$$-means++ clustering. In: Proceedings of the 14th modeling decisions for artificial intelligence (MDAI), pp 103–114
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献