{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:01:39Z","timestamp":1772906499329,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819682942","type":"print"},{"value":"9789819682959","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-8295-9_32","type":"book-chapter","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T17:47:05Z","timestamp":1750355225000},"page":"432-443","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast Approximation Algorithm for\u00a0Euclidean Minimum Spanning Tree Building in\u00a0High Dimensions"],"prefix":"10.1007","author":[{"given":"Keito","family":"Kido","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8571-4931","authenticated-orcid":false,"given":"Daichi","family":"Amagata","sequence":"additional","affiliation":[]},{"given":"Takahiro","family":"Hara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,20]]},"reference":[{"key":"32_CR1","unstructured":"http:\/\/corpus-texmex.irisa.fr\/"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Edelsbrunner, H., Schwarzkopf, O., Welzl, E.: Euclidean minimum spanning trees and bichromatic closest pairs. In: SoCG, pp. 203\u2013210 (1990)","DOI":"10.1145\/98524.98567"},{"issue":"10","key":"32_CR3","doi-asserted-by":"publisher","first-page":"3994","DOI":"10.1109\/TVCG.2020.2995465","volume":"27","author":"D Alcaide","year":"2020","unstructured":"Alcaide, D., Aerts, J.: Spanning trees as approximation of data structures. IEEE Trans. Visual Comput. Graphics 27(10), 3994\u20134008 (2020)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Amagata, D., Onizuka, M., Hara, T.: Fast and exact outlier detection in metric spaces: a proximity graph-based approach. In: SIGMOD, pp. 36\u201348 (2021)","DOI":"10.1145\/3448016.3452782"},{"issue":"4","key":"32_CR5","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/s00778-022-00729-1","volume":"31","author":"D Amagata","year":"2022","unstructured":"Amagata, D., Onizuka, M., Hara, T.: Fast, exact, and parallel-friendly outlier detection algorithms with proximity graph in metric spaces. VLDB J. 31(4), 797\u2013821 (2022)","journal-title":"VLDB J."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Arai, Y., Amagata, D., Fujita, S., Hara, T.: LGTM: a fast and accurate KNN search algorithm in high-dimensional spaces. In: DEXA, pp. 220\u2013231 (2021)","DOI":"10.1007\/978-3-030-86475-0_22"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Arya, S., Mount, D.M.: A fast and simple algorithm for computing approximate euclidean minimum spanning trees. In: SODA, pp. 1220\u20131233 (2016)","DOI":"10.1137\/1.9781611974331.ch85"},{"issue":"3","key":"32_CR8","first-page":"37","volume":"3","author":"O Bor\u016fvka","year":"1926","unstructured":"Bor\u016fvka, O.: O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. Pr\u00e1ce Moravsk\u00e9 p\u0159\u00edrodov\u011bdeck\u00e9 spole\u010dnosti 3(3), 37\u201358 (1926)","journal-title":"Pr\u00e1ce Moravsk\u00e9 p\u0159\u00edrodov\u011bdeck\u00e9 spole\u010dnosti"},{"key":"32_CR9","unstructured":"Callahan, P.B., Kosaraju, S.R.: Faster algorithms for some geometric graph problems in higher dimensions. In: SODA, vol.\u00a093, pp. 291\u2013300 (1993)"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Chen, X., Cohen-Addad, V., Jayaram, R., Levi, A., Waingarten, E.: Streaming euclidean MST to a constant factor. In: STOC, pp. 156\u2013169 (2023)","DOI":"10.1145\/3564246.3585168"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Chen, X., Jayaram, R., Levi, A., Waingarten, E.: New streaming algorithms for high dimensional EMD and MST. In: StOC, pp. 222\u2013233 (2022)","DOI":"10.1145\/3519935.3519979"},{"issue":"1","key":"32_CR12","first-page":"801","volume":"14","author":"RR Curtin","year":"2013","unstructured":"Curtin, R.R., et al.: MLPACK: a scalable C++ machine learning library. J. Mach. Learn. Res. 14(1), 801\u2013805 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"6","key":"32_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/MSP.2012.2211477","volume":"29","author":"L Deng","year":"2012","unstructured":"Deng, L.: The MNIST database of handwritten digit images for machine learning research. IEEE Signal Process. Mag. 29(6), 141\u2013142 (2012)","journal-title":"IEEE Signal Process. Mag."},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Dong, W., Moses, C., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: World Wide Web, pp. 577\u2013586 (2011)","DOI":"10.1145\/1963405.1963487"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Jayaram, R., Mirrokni, V., Narayanan, S., Zhong, P.: Massively parallel algorithms for high-dimensional euclidean minimum spanning tree. In: SODA, pp. 3960\u20133996 (2024)","DOI":"10.1137\/1.9781611977912.139"},{"issue":"1","key":"32_CR16","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Amer. Math. Soc."},{"issue":"8","key":"32_CR17","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/TKDE.2019.2909204","volume":"32","author":"W Li","year":"2019","unstructured":"Li, W., et al.: Approximate nearest neighbor search on high dimensional data-experiments, analyses, and improvement. IEEE Trans. Knowl. Data Eng. 32(8), 1475\u20131488 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"32_CR18","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2018","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2018)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"March, W.B., Ram, P., Gray, A.G.: Fast euclidean minimum spanning tree: algorithm, analysis, and applications. In: SIGKDD, pp. 603\u2013612 (2010)","DOI":"10.1145\/1835804.1835882"},{"key":"32_CR20","unstructured":"Mikolov, T., Grave, \u00c9., Bojanowski, P., Puhrsch, C., Joulin, A.: Advances in pre-training distributed word representations. In: LREC (2018)"},{"issue":"2","key":"32_CR21","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1093\/mnras\/stz3075","volume":"491","author":"K Naidoo","year":"2020","unstructured":"Naidoo, K., et al.: Beyond two-point statistics: using the minimum spanning tree as a tool for cosmology. Mon. Not. R. Astron. Soc. 491(2), 1709\u20131726 (2020)","journal-title":"Mon. Not. R. Astron. Soc."},{"key":"32_CR22","unstructured":"Narasimhan, G., Zhu, J., Zachariasen, M.: Experiments with computing geometric minimum spanning trees. In: ALENEX, pp. 183\u2013196 (2000)"},{"key":"32_CR23","unstructured":"Narayanan, S., Silwal, S., Indyk, P., Zamir, O.: Randomized dimensionality reduction for facility location and single-linkage clustering. In: ICML, pp. 7948\u20137957 (2021)"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Pennington, J., Socher, R., Manning, C.D.: Glove: global vectors for word representation. In: EMNLP, pp. 1532\u20131543 (2014)","DOI":"10.3115\/v1\/D14-1162"},{"issue":"6","key":"32_CR25","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"32_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13321-020-0416-x","volume":"12","author":"D Probst","year":"2020","unstructured":"Probst, D., Reymond, J.-L.: Visualization of very large high-dimensional data sets as minimum spanning trees. J. Cheminform. 12(1), 1\u201313 (2020). https:\/\/doi.org\/10.1186\/s13321-020-0416-x","journal-title":"J. Cheminform."},{"key":"32_CR27","doi-asserted-by":"crossref","unstructured":"Prokopenko, A., Sao, P., Lebrun-Grandi\u00e9, D.: A single-tree algorithm to compute the euclidean minimum spanning tree on GPUs. In: ICPP, pp. 1\u201310 (2022)","DOI":"10.1145\/3545008.3546185"},{"key":"32_CR28","doi-asserted-by":"crossref","unstructured":"Shamos, M.I., Hoey, D.: Closest-point problems. In: SFCS, pp. 151\u2013162 (1975)","DOI":"10.1109\/SFCS.1975.8"},{"issue":"1","key":"32_CR29","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R Sibson","year":"1973","unstructured":"Sibson, R.: Slink: an optimally efficient algorithm for the single-link cluster method. Comput. J. 16(1), 30\u201334 (1973)","journal-title":"Comput. J."},{"key":"32_CR30","doi-asserted-by":"crossref","unstructured":"Uemura, R., Amagata, D., Hara, T.: An efficient framework for approximate nearest neighbor search on high-dimensional multi-metric data. In: SISAP, pp. 3\u201317 (2024)","DOI":"10.1007\/978-3-031-75823-2_1"},{"key":"32_CR31","doi-asserted-by":"crossref","unstructured":"Wang, Y., Yu, S., Gu, Y., Shun, J.: Fast parallel algorithms for euclidean minimum spanning tree and hierarchical spatial clustering. In: SIGMOD, pp. 1982\u20131995 (2021)","DOI":"10.1145\/3448016.3457296"},{"issue":"4","key":"32_CR32","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A Yao","year":"1982","unstructured":"Yao, A.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11(4), 721\u2013736 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Data Science: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-8295-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T17:47:10Z","timestamp":1750355230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8295-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819682942","9789819682959"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8295-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}