{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:24:13Z","timestamp":1743031453523,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031469930"},{"type":"electronic","value":"9783031469947"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-46994-7_13","type":"book-chapter","created":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T07:02:16Z","timestamp":1698303736000},"page":"148-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Accelerating k-Means Clustering with\u00a0Cover Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3212-5548","authenticated-orcid":false,"given":"Andreas","family":"Lang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9143-4880","authenticated-orcid":false,"given":"Erich","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,27]]},"reference":[{"key":"13_CR1","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1027\u20131035 (2007)"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Beygelzimer, A., Kakade, S.M., Langford, J.: Cover trees for nearest neighbor. In: International Conference on Machine Learning, ICML, pp. 97\u2013104 (2006). https:\/\/doi.org\/10.1145\/1143844.1143857","DOI":"10.1145\/1143844.1143857"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Borgelt, C.: Even faster exact k-means clustering. In: International Symposium on 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"},{"key":"13_CR4","unstructured":"Bradley, P.S., Fayyad, U.M., Reina, C.: Scaling clustering algorithms to large databases. In: KDD"},{"key":"13_CR5","unstructured":"Elkan, C.: Using the triangle inequality to accelerate k-means. In: International Conference on Machine Learning, ICML, pp. 147\u2013153 (2003)"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Fichtenberger, H., Gill\u00e9, M., Schmidt, M., Schwiegelshohn, C., Sohler, C.: BICO: BIRCH meets coresets for k-means clustering. In: ESA, pp. 481\u2013492 (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_41","DOI":"10.1007\/978-3-642-40450-4_41"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Hamerly, G.: Making k-means even faster. In: SIAM Data Mining, SDM, pp. 130\u2013140 (2010). https:\/\/doi.org\/10.1137\/1.9781611972801.12","DOI":"10.1137\/1.9781611972801.12"},{"issue":"7","key":"13_CR8","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell. 24(7), 881\u2013892 (2002). https:\/\/doi.org\/10.1109\/TPAMI.2002.1017616","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10115-016-1004-2","volume":"52","author":"H Kriegel","year":"2017","unstructured":"Kriegel, H., Schubert, E., Zimek, A.: The (black) art of runtime evaluation: are we comparing algorithms or implementations? Knowl. Inf. Syst. 52(2), 341\u2013378 (2017). https:\/\/doi.org\/10.1007\/s10115-016-1004-2","journal-title":"Knowl. Inf. Syst."},{"key":"13_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2021.101918","volume":"108","author":"A Lang","year":"2022","unstructured":"Lang, A., Schubert, E.: BETULA: fast clustering of large data with improved BIRCH CF-trees. Inf. Syst. 108, 101918 (2022). https:\/\/doi.org\/10.1016\/j.is.2021.101918","journal-title":"Inf. Syst."},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013136 (1982). https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Mahajan, M., Nimbhorkar, P., Varadarajan, K.R.: The planar k-means problem is NP-hard. In: WALCOM: Algorithms and Computation, pp. 274\u2013285 (2009). https:\/\/doi.org\/10.1007\/978-3-642-00202-1_24","DOI":"10.1007\/978-3-642-00202-1_24"},{"key":"13_CR13","unstructured":"Newling, J., Fleuret, F.: Fast k-means with accurate bounds. In: International Conference on Machine Learning, vol. 48, pp. 936\u2013944 (2016)"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Pelleg, D., Moore, A.W.: Accelerating exact k-means algorithms with geometric reasoning. In: KDD, pp. 277\u2013281 (1999) https:\/\/doi.org\/10.1145\/312129.312248","DOI":"10.1145\/312129.312248"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Phillips, S.J.: Acceleration of k-means and related clustering algorithms. In: International Workshop on Algorithm Engineering and Experiments, ALENEX, pp. 166\u2013177 (2002). https:\/\/doi.org\/10.1007\/3-540-45643-0_13","DOI":"10.1007\/3-540-45643-0_13"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1214\/aos\/1176345339","volume":"9","author":"D Pollard","year":"1981","unstructured":"Pollard, D.: Strong consistency of k-means clustering. Ann. Stat. 9(1), 135\u2013140 (1981)","journal-title":"Ann. Stat."},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Schubert, E.: A triangle inequality for cosine similarity. In: Similarity Search and Applications, SISAP, pp. 32\u201344 (2021). https:\/\/doi.org\/10.1007\/978-3-030-89657-7_3","DOI":"10.1007\/978-3-030-89657-7_3"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Schubert, E.: Automatic indexing for similarity search in ELKI. In: Similarity Search and Applications, SISAP (2022). https:\/\/doi.org\/10.1007\/978-3-031-17849-8_16","DOI":"10.1007\/978-3-031-17849-8_16"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/3606274.3606278","volume":"25","author":"E Schubert","year":"2023","unstructured":"Schubert, E.: Stop using the elbow criterion for k-means and how to choose the number of clusters instead. SIGKDD Explor. 25(1), 36\u201342 (2023). https:\/\/doi.org\/10.1145\/3606274.3606278","journal-title":"SIGKDD Explor."},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Schubert, E., Lang, A., Feher, G.: Accelerating spherical k-means. In: Similarity Search and Applications, SISAP, pp. 217\u2013231 (2021). https:\/\/doi.org\/10.1007\/978-3-030-89657-7_17","DOI":"10.1007\/978-3-030-89657-7_17"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Schubert, E., Zimek, A.: ELKI Multi-View Clustering Data Sets Based on the Amsterdam Library of Object Images (ALOI). https:\/\/doi.org\/10.5281\/zenodo.6355684. Zenodo, June 2010","DOI":"10.5281\/zenodo.6355684"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Sculley, D.: Web-scale k-means clustering. In: World Wide Web, WWW, pp. 1177\u20131178 (2010). https:\/\/doi.org\/10.1145\/1772690.1772862","DOI":"10.1145\/1772690.1772862"},{"key":"13_CR23","first-page":"801","volume":"1","author":"H Steinhaus","year":"1956","unstructured":"Steinhaus, H.: Sur la division des corp materiels en parties. Bull. Acad. Polon. Sci 1, 801\u2013804 (1956)","journal-title":"Bull. Acad. Polon. Sci"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Yu, Q., Chen, K., Chen, J.: Using a set of triangle inequalities to accelerate k-means clustering. In: 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-031-46994-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T07:03:40Z","timestamp":1698303820000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46994-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031469930","9783031469947"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46994-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 October 2023","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":"Coruna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.sisap.org\/2023\/","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":"33","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":"16","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":"4","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":"48% - 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","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":"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)"}},{"value":"Familiarity, LaTeX and LNCS friendly, steering committee has subscription","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}