{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:28:25Z","timestamp":1760707705306},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540378716"},{"type":"electronic","value":"9783540378723"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11827405_84","type":"book-chapter","created":{"date-parts":[[2006,9,18]],"date-time":"2006-09-18T15:44:55Z","timestamp":1158594295000},"page":"863-872","source":"Crossref","is-referenced-by-count":10,"title":["An Effective Method for Approximating the Euclidean Distance in High-Dimensional Space"],"prefix":"10.1007","author":[{"given":"Seungdo","family":"Jeong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Wook","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kidong","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung-Uk","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"84_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/3-540-57301-1_5","volume-title":"Foundations of Data Organization and Algorithms","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Faloutsos, C., Swami, A.: Efficient Similarity Search in Sequence Database. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol.\u00a0730, pp. 69\u201384. Springer, Heidelberg (1993)"},{"key":"84_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume-title":"Database Theory - ICDT\u201999","author":"K. Beyer","year":"1998","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is nearest neighbor meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"issue":"3","key":"84_CR3","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. Bohm","year":"2001","unstructured":"Bohm, C., Berchtold, S., Keim, D.A.: Searching in High-Dimensional Spaces-Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys\u00a033(3), 322\u2013373 (2001)","journal-title":"ACM Computing Surveys"},{"key":"84_CR4","doi-asserted-by":"crossref","unstructured":"Egecioglu, O., Ferhatosmanoglu, H.: Dimensionality Reduction and Similarity Computation by Inner Product Approximations. In: Proc. of the 9th ACM Int\u2019l Conf. on Information and Knowledge Management, pp. 219\u2013226 (2000)","DOI":"10.1145\/354756.354822"},{"key":"84_CR5","doi-asserted-by":"crossref","unstructured":"Ogras, U.Y., Ferhatosmanoglu, H.: Dimensionality Reduction Using Magnitude and Shape Approximations. In: Proc. of the 12th Int\u2019l Conf. on Information and Knowledge Management, pp. 99\u2013107 (2003)","DOI":"10.1145\/956863.956883"},{"issue":"3\/4","key":"84_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF00962238","volume":"3","author":"C. Faloutsos","year":"1994","unstructured":"Faloutsos, C., Barber, R., Flickner, M., Niblack, W., Petkovic, D., Equitz, W.: Efficient and Effective Querying By Image Content. Journal of Intelligent Information Systems\u00a03(3\/4), 231\u2013262 (1994)","journal-title":"Journal of Intelligent Information Systems"},{"key":"84_CR7","unstructured":"Seidl, T., Kriegel, H.-P.: Efficient User-Adaptable Similarity Search in Large Multimedia Databases. In: Proc. of 23rd Int\u2019l. Conf. on Very Large Data Bases, pp. 506\u2013515 (1997)"},{"key":"84_CR8","unstructured":"Weber, R., Schek, H.J., Blott, S.: A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In: Proc. of 24th Int\u2019l Conf. on Very Large Data Bases, pp. 194\u2013205 (1998)"},{"key":"84_CR9","unstructured":"http:\/\/kdd.ics.uci.edu\/databases\/CorelFeatures\/CorelFeatures.html"},{"key":"84_CR10","unstructured":"Jeong, S., Kim, S.-W., Kim, K., Choi, B.-U.: An Effective Method for Approximating the Euclidean Distance in High-Dimensional Space (unpublished manuscript)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11827405_84.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:18:09Z","timestamp":1605644289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11827405_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540378716","9783540378723"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11827405_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}