{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T21:04:34Z","timestamp":1781039074287,"version":"3.54.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T00:00:00Z","timestamp":1556841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Higher Educational Science and Technology Program of Shandong Province","award":["J17KA171"],"award-info":[{"award-number":["J17KA171"]}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11531014"],"award-info":[{"award-number":["11531014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11871081"],"award-info":[{"award-number":["11871081"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11801310"],"award-info":[{"award-number":["11801310"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10898-019-00779-w","type":"journal-article","created":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:02:40Z","timestamp":1556863360000},"page":"695-708","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["The seeding algorithms for spherical k-means clustering"],"prefix":"10.1007","volume":"76","author":[{"given":"Min","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan","family":"Zou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,5,3]]},"reference":[{"key":"779_CR1","unstructured":"Ackermann, M.R.: Algorithms for the Bregman $$k$$-Median Problem. In: Ph.D. Thesis, University of Paderborn (2009)"},{"key":"779_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Deshpande, A., Kannan, R.: Adaptive sampling for $$k$$-means clustering. In: Proceedings of APPROX and RANDOM, pp. 15\u201328 (2009)","DOI":"10.1007\/978-3-642-03685-9_2"},{"key":"779_CR3","doi-asserted-by":"crossref","unstructured":"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\u201372 (2017)","DOI":"10.1109\/FOCS.2017.15"},{"key":"779_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D Aloise","year":"2009","unstructured":"Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75, 245\u2013248 (2009)","journal-title":"Mach. Learn."},{"key":"779_CR5","unstructured":"Arthur, D., Vassilvitskii, S.: $$k$$-means++: The advantages of careful seeding. In: Proceedings of SODA, pp. 1027\u20131035 (2007)"},{"key":"779_CR6","unstructured":"Awasthi, P., Charikar, M., Krishnaswamy, R., Sinop, A.K.: The hardness of approximation of Euclidean $$k$$-means. In: Proceedings of SoCG, pp. 754\u2013767 (2015)"},{"key":"779_CR7","doi-asserted-by":"crossref","unstructured":"Bachem, O., Lucic, M., Hassani, S.H., Krause, A.: Approximate $$k$$-means++ in sublinear time. In: Proceedings of AAAI, pp. 1459\u20131467 (2016)","DOI":"10.1609\/aaai.v30i1.10259"},{"key":"779_CR8","unstructured":"Bachem, O., Lucic, M., Hassani, S.H., Krause, A.: Fast and provably good seedings for $$k$$-means. In: Proceedings of NIPS, pp. 55\u201363 (2016)"},{"key":"779_CR9","unstructured":"Bachem, O., Lucic, M., Krause, A.: Distributed and provably good seedings for $$k$$-means in constant rounds. In: Proceedings of ICML, pp. 292\u2013300 (2017)"},{"key":"779_CR10","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Moseley, B., Vattani, A., Kumar, R., Vassilvitskii, S.: Scalable $$k$$-means++. In: Proceedings of the VLDB Endowment, pp. 622\u2013633 (2012)","DOI":"10.14778\/2180912.2180915"},{"key":"779_CR11","first-page":"1345","volume":"6","author":"A Banerjee","year":"2005","unstructured":"Banerjee, A., Dhillon, I.S., Ghosh, J., Sra, S.: Clustering on the unit hypersphere using von mises-fisher distributions. J. Mach. Learn. Res. 6, 1345\u20131382 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"779_CR12","doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer, J., Lammersen, C., Schmidt, M., Sohler, C.: Theoretical analysis of the $$k$$-means algorithm - a survey. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering, Springer International Publishing, pp. 81\u2013116 (2016)","DOI":"10.1007\/978-3-319-49487-6_3"},{"key":"779_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1007612920971","volume":"42","author":"IS Dhillon","year":"2001","unstructured":"Dhillon, I.S., Modha, D.S.: Concept decompositions for large sparse text data using clustering. Mach. Learn. 42, 143\u2013175 (2001)","journal-title":"Mach. Learn."},{"key":"779_CR14","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","volume":"56","author":"P Drineas","year":"2004","unstructured":"Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering large graphs via the singular value decomposition. Mach. Learn. 56, 9\u201333 (2004)","journal-title":"Mach. Learn."},{"key":"779_CR15","doi-asserted-by":"crossref","unstructured":"Endo, Y., Miyamoto, S.: Spherical $$k$$-Means++ clustering. In: Proceedings of MDAI, pp. 103\u2013114 (2015)","DOI":"10.1007\/978-3-319-23240-9_9"},{"key":"779_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v050.i10","volume":"50","author":"K Hornik","year":"2012","unstructured":"Hornik, K., Feinerer, I., Kober, M., Buchta, C.: Spherical $$k$$-means clustering. J. Stat. Softw. 50, 1\u201322 (2012)","journal-title":"J. Stat. Softw."},{"key":"779_CR17","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ipl.2016.11.009","volume":"120","author":"E Lee","year":"2017","unstructured":"Lee, E., Schmidt, M., Wright, J.: Improved and simplified inapproximability for $$k$$-means. Inf. Process. Lett. 120, 40\u201343 (2017)","journal-title":"Inf. Process. Lett."},{"key":"779_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28, 21\u201333 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"779_CR19","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1145\/2395116.2395117","volume":"59","author":"R Ostrovsky","year":"2012","unstructured":"Ostrovsky, R., Rabani, Y., Schulman, L.J., Swamy, C.: The effectiveness of Lloyd-type methods for the $$k$$-means problem. J. ACM 59, 139\u2013156 (2012)","journal-title":"J. ACM"},{"key":"779_CR20","unstructured":"Zhao, Y., Karypis, G.: Criterion functions for document clustering: experiments and analysis. In: Technical Report $$\\sharp $$01-40, Department of Computer Science, University of Minnesota, November (2001)"},{"key":"779_CR21","unstructured":"Zhong, S.: Efficient online spherical $$k$$-means clustering. In: Proceedings of IJCNN, pp. 3180\u20133185 (2005)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00779-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00779-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00779-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T09:22:17Z","timestamp":1663406537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00779-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,3]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["779"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00779-w","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,3]]},"assertion":[{"value":"28 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}