{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:35:57Z","timestamp":1743071757651,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030271947"},{"type":"electronic","value":"9783030271954"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-27195-4_14","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T09:03:14Z","timestamp":1564650194000},"page":"149-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Seeding Algorithm for Spherical k-Means Clustering with Penalties"],"prefix":"10.1007","author":[{"given":"Sai","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"key":"14_CR1","unstructured":"Awasthi, P., Charikar, M., Krishnaswamy, R., Sinop, A.: The hardness of approximation of Euclidean $$k$$-means, arXiv preprint arXiv:1502.03316 (2015)"},{"issue":"2","key":"14_CR2","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.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245\u2013248 (2009)","journal-title":"Mach. Learn."},{"key":"14_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 the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 61\u201372 (2017)","DOI":"10.1109\/FOCS.2017.15"},{"key":"14_CR4","unstructured":"Arthur, D., Vassilvitskii, S.: $$k$$-means++: the advantages of careful seeding. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1027\u20131035 (2007)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer, J., Brauer, S., Bujna, K.: A theoretical analysis of the fuzzy $$k$$-means problem. In: Proceedings of the 16th IEEE International Conference on Data Mining (ICDM), pp. 805\u2013810 (2017)","DOI":"10.1109\/ICDM.2016.0094"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-319-49487-6_3","volume-title":"Algorithm Engineering","author":"J Bl\u00f6mer","year":"2016","unstructured":"Bl\u00f6mer, J., Lammersen, C., Schmidt, M., Sohler, C.: Theoretical analysis of the k-means algorithm \u2013 a survey. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, vol. 9220, pp. 81\u2013116. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49487-6_3"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/17M112717X","volume":"48","author":"V Cohen-Addad","year":"2019","unstructured":"Cohen-Addad, V., Klein, P.N., Mathieu, C.: Local search yields approximation schemes for $$k$$-means and $$k$$-median in Euclidean and minor-free metrics. SIAM J. Comput. 48(2), 644\u2013667 (2019)","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"14_CR8","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, V.: Clustering large graphs via the singular value decomposition. Mach. Learn. 56(1\u20133), 9\u201333 (2004)","journal-title":"Mach. Learn."},{"issue":"1\u20132","key":"14_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1007612920971","volume":"42","author":"I Dhillon","year":"2001","unstructured":"Dhillon, I., Modha, D.: Concept decompositions for large sparse text data using clustering. Mach. Learn. 42(1\u20132), 143\u2013175 (2001)","journal-title":"Mach. Learn."},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-23240-9_9","volume-title":"Modeling Decisions for Artificial Intelligence","author":"Y Endo","year":"2015","unstructured":"Endo, Y., Miyamoto, S.: Spherical k-means++ clustering. In: Torra, V., Narukawa, Y. (eds.) MDAI 2015. LNCS (LNAI), vol. 9321, pp. 103\u2013114. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23240-9_9"},{"issue":"7","key":"14_CR11","doi-asserted-by":"publisher","first-page":"757","DOI":"10.14778\/3067421.3067425","volume":"10","author":"S Gupta","year":"2017","unstructured":"Gupta, S., Kumar, R., Lu, K., Moseley, B., Vassilvitskii, S.: Local search methods for $$k$$-means with outliers. Proc. VLDB Endow. 10(7), 757\u2013768 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"10","key":"14_CR12","first-page":"1","volume":"50","author":"K Hornik","year":"2015","unstructured":"Hornik, K., Feinerer, I., Kober, M., Buchata, M.: Spherical $$k$$-means clustering. J. Stat. Softw. 50(10), 1\u201322 (2015)","journal-title":"J. Stat. Softw."},{"issue":"2\u20133","key":"14_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.comgeo.2004.03.003","volume":"28","author":"T Kanungo","year":"2004","unstructured":"Kanungo, T., Mount, D., Netanyahu, N., Piatko, C., Silverma, R.: A local search approximation algorithm for $$k$$-means clustering. Comput. Geom. 28(2\u20133), 89\u2013112 (2004)","journal-title":"Comput. Geom."},{"issue":"2","key":"14_CR14","first-page":"129","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans."},{"key":"14_CR15","unstructured":"Li, M., Xu, D., Yue, J., Zhang, D., Zhang, P.: The seeding algorithm for $$k$$-means with penalties. J. Comb. Optim. (under review)"},{"key":"14_CR16","unstructured":"Li, M., Xu, D., Zhang, D., Zou, J.: The seeding algorithms for spherical $$k$$-means clustering. J. Global Optim. 1\u201314 (2019)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Moriya, T., Roth, H., Nakamura, S., Oda, H., Kai, N., Oda, M.: Unsupervised pathology image segmentation using representation learning with spherical $$k$$-means. In: Digital Pathology, p. 36 (2018)","DOI":"10.1117\/12.2292172"},{"issue":"1","key":"14_CR18","first-page":"12","volume":"13","author":"V Tunali","year":"2016","unstructured":"Tunali, V., Bilgin, T., Camurcu, A.: An improved clustering algorithm for text mining: multi-cluster spherical $$k$$-means. Int. Arab J. Inf. Technol. 13(1), 12\u201319 (2016)","journal-title":"Int. Arab J. Inf. Technol."},{"key":"14_CR19","unstructured":"Xu, J., Han, J., Xiong, K., Nie F.: Robust and sparse fuzzy $$k$$-means clustering. In: Proceedings 25th International Joint Conference on Artificial Intelligence (IJCAI), pp. 2224\u20132230 (2016)"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s11248-011-9513-y","volume":"21","author":"D Xu","year":"2017","unstructured":"Xu, D., Xu, Y., Zhang, D.: A survey on algorithm for $$k$$-means and its variants. Oper. Res. Trans. 21, 101\u2013109 (2017)","journal-title":"Oper. Res. Trans."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27195-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:16:38Z","timestamp":1709824598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27195-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030271947","9783030271954"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27195-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/theory.ict.ac.cn\/aaim2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}