{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:32:17Z","timestamp":1767339137950,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030896560"},{"type":"electronic","value":"9783030896577"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89657-7_17","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T21:02:48Z","timestamp":1634850168000},"page":"217-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Accelerating Spherical k-Means"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9143-4880","authenticated-orcid":false,"given":"Erich","family":"Schubert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3212-5548","authenticated-orcid":false,"given":"Andreas","family":"Lang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0859-2042","authenticated-orcid":false,"given":"Gloria","family":"Feher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,22]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Alamoudi, S., Hong, X., Wei, H.: Plant leaf recognition using texture features and semi-supervised spherical k-means clustering. In: IJCNN, pp. 1\u20138 (2020). https:\/\/doi.org\/10.1109\/IJCNN48605.2020.9207386","DOI":"10.1109\/IJCNN48605.2020.9207386"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"052011","DOI":"10.1088\/1757-899x\/546\/5\/052011","volume":"546","author":"RZ Arfiani","year":"2019","unstructured":"Arfiani, R.Z., Pandelaki, J., Siahaan, A.: Kernel spherical k-means and support vector machine for acute sinusitis classification. IOP Conf. Ser. Mater. Sci. Eng. 546, 052011 (2019). https:\/\/doi.org\/10.1088\/1757-899x\/546\/5\/052011","journal-title":"IOP Conf. Ser. Mater. Sci. Eng."},{"key":"17_CR3","unstructured":"Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: ACM-SIAM Symposium on Discrete Algorithms, SODA (2007)"},{"key":"17_CR4","unstructured":"Bachem, O., Lucic, M., Hassani, S.H., Krause, A.: Fast and provably good seedings for k-means. In: Neural Information Processing Systems (2016)"},{"key":"17_CR5","unstructured":"Bachem, O., Lucic, M., Krause, A.: Distributed and provably good seedings for k-means in constant rounds. In: International Conference on Machine Learning (2017)"},{"issue":"7","key":"17_CR6","doi-asserted-by":"publisher","first-page":"622","DOI":"10.14778\/2180912.2180915","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani, B., Moseley, B., Vattani, A., Kumar, R., Vassilvitskii, S.: Scalable k-means++. Proc. VLDB Endow. 5(7), 622\u2013633 (2012). https:\/\/doi.org\/10.14778\/2180912.2180915","journal-title":"Proc. VLDB Endow."},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Borgelt, C.: Even faster exact k-means clustering. In: Int. Symp. Intelligent Data Analysis, IDA, pp. 93\u2013105 (2020). https:\/\/doi.org\/10.1007\/978-3-030-44584-3_8","DOI":"10.1007\/978-3-030-44584-3_8"},{"issue":"1\/2","key":"17_CR8","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(1\/2), 143\u2013175 (2001). https:\/\/doi.org\/10.1023\/A:1007612920971","journal-title":"Mach. Learn."},{"key":"17_CR9","unstructured":"Ding, Y., Zhao, Y., Shen, X., Musuvathi, M., Mytkowicz, T.: Yinyang k-means: A drop-in replacement of the classic k-means with consistent speedup. In: International Conference on Machine Learning (2015)"},{"key":"17_CR10","unstructured":"Elkan, C.: Using the triangle inequality to accelerate k-means. In: International Conference on Machine Learning (2003)"},{"key":"17_CR11","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"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Hamerly, G.: Making k-means even faster. In: SIAM Int. Conf. Data Mining, pp. 130\u2013140 (2010). https:\/\/doi.org\/10.1137\/1.9781611972801.12","DOI":"10.1137\/1.9781611972801.12"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-09259-1_2","volume-title":"Partitional Clustering Algorithms","author":"G Hamerly","year":"2015","unstructured":"Hamerly, G., Drake, J.: Accelerating Lloyd\u2019s algorithm for k-means clustering. In: Celebi, M.E. (ed.) Partitional Clustering Algorithms, pp. 41\u201378. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-09259-1_2"},{"issue":"6","key":"17_CR14","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1111\/2041-210X.12038","volume":"4","author":"MO Hill","year":"2013","unstructured":"Hill, M.O., Harrower, C.A., Preston, C.D.: Spherical k-means clustering is good for interpreting multivariate species occurrence data. Methods Ecol. Evol. 4(6), 542\u2013551 (2013). https:\/\/doi.org\/10.1111\/2041-210X.12038","journal-title":"Methods Ecol. Evol."},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10115-016-1004-2","volume":"52","author":"H-P Kriegel","year":"2016","unstructured":"Kriegel, H.-P., Schubert, E., Zimek, A.: The (black) art of runtime evaluation: are we comparing algorithms or implementations? Knowl. Inf. Syst. 52(2), 341\u2013378 (2016). https:\/\/doi.org\/10.1007\/s10115-016-1004-2","journal-title":"Knowl. Inf. Syst."},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Lang, A., Schubert, E.: BETULA: numerically stable CF-trees for BIRCH clustering. In: International Conference on Similarity Search and Applications, SISAP, pp. 281\u2013296 (2020). https:\/\/doi.org\/10.1007\/978-3-030-60936-8_22","DOI":"10.1007\/978-3-030-60936-8_22"},{"key":"17_CR17","first-page":"361","volume":"5","author":"DD Lewis","year":"2004","unstructured":"Lewis, D.D., Yang, Y., Rose, T.G., Li, F.: RCV1: a new benchmark collection for text categorization research. J. Mach. Learn. Res. 5, 361\u2013397 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45735-6_1","volume-title":"String Processing and Information Retrieval","author":"M Ley","year":"2002","unstructured":"Ley, M.: The DBLP computer science bibliography: evolution, research issues, perspectives. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 1\u201310. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45735-6_1"},{"issue":"4","key":"17_CR19","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s10898-019-00779-w","volume":"76","author":"M Li","year":"2020","unstructured":"Li, M., Xu, D., Zhang, D., Zou, J.: The seeding algorithms for spherical k-means clustering. J. Glob. Optim. 76(4), 695\u2013708 (2020). https:\/\/doi.org\/10.1007\/s10898-019-00779-w","journal-title":"J. Glob. Optim."},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Moriya, T., et al.: Unsupervised pathology image segmentation using representation learning with spherical k-means. In: Medical Imaging 2018: Digital Pathology. vol. 10581, p. 1058111 (2018). https:\/\/doi.org\/10.1117\/12.2292172","DOI":"10.1117\/12.2292172"},{"key":"17_CR21","unstructured":"Newling, J., Fleuret, F.: Fast k-means with accurate bounds. In: International Conference on Machine Learning (2016)"},{"key":"17_CR22","unstructured":"Pratap, R., Deshmukh, A.A., Nair, P., Dutt, T.: A faster sampling algorithm for spherical k-means. In: Asian Conference on Machine Learning (2018)"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Schubert, E.: A triangle inequality for cosine similarity. In: International Conference on Similarity Search and Applications, SISAP (2021). https:\/\/doi.org\/10.1007\/978-3-030-89657-7_3","DOI":"10.1007\/978-3-030-89657-7_3"},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"Schubert, E., Gertz, M.: Numerically stable parallel computation of (co-)variance. In: International Conference on Scientific and Statistical Database Management, pp. 10:1\u201310:12 (2018). https:\/\/doi.org\/10.1145\/3221269.3223036","DOI":"10.1145\/3221269.3223036"},{"key":"17_CR25","unstructured":"Schubert, E., Zimek, A.: ELKI: a large open-source library for data analysis - ELKI release 0.7.5 \u201cHeidelberg\u201d. CoRR abs\/1902.03616 (2019). http:\/\/arxiv.org\/abs\/1902.03616"},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"Yu, Q., Chen, K., Chen, J.: Using a set of triangle inequalities to accelerate k-means clustering. In: International Conference on Similarity Search and Applications, SISAP, pp. 297\u2013311 (2020). https:\/\/doi.org\/10.1007\/978-3-030-60936-8_23","DOI":"10.1007\/978-3-030-60936-8_23"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89657-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T21:07:45Z","timestamp":1634850465000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89657-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030896560","9783030896577"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89657-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sisap.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}