{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T18:08:20Z","timestamp":1779905300525,"version":"3.53.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,10,21]],"date-time":"2008-10-21T00:00:00Z","timestamp":1224547200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s11042-008-0243-y","type":"journal-article","created":{"date-parts":[[2008,10,20]],"date-time":"2008-10-20T08:43:05Z","timestamp":1224492185000},"page":"251-271","source":"Crossref","is-referenced-by-count":7,"title":["Dimensionality reduction for similarity search with the Euclidean distance in high-dimensional applications"],"prefix":"10.1007","volume":"42","author":[{"given":"Seungdo","family":"Jeong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sang-Wook","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Byung-Uk","family":"Choi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,10,21]]},"reference":[{"key":"243_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC (2001) On the effects of dimensionality reduction on high dimensional similarity search. In: Proc. int\u2019l. symp. on principles of database systems, ACM SIGACT-SIGMOD-SIGART, Santa Barbara, 21\u201323 May 2001, pp 256\u2013266","DOI":"10.1145\/375551.383213"},{"key":"243_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Faloutsos C, Swami A (1993) Efficient similarity search in sequence databases. In: Proc. int\u2019l. conf. on foundations of data organization and algorithms, FODO, Chicago, 13\u201315 October 1993, pp 69\u201384","DOI":"10.1007\/3-540-57301-1_5"},{"key":"243_CR3","unstructured":"Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proc. intl. conf. on management of data, ACM SIGMOD, Atlantic City, 23\u201325 May 1990, pp 322\u2013331"},{"key":"243_CR4","doi-asserted-by":"crossref","unstructured":"Berchtold S, B\u00f6hm C, Braunm\u00fcller B, Keim D, Kriegel H-P (1997) Fast parallel similarity search in multimedia databases. In: Proc. int\u2019l. conf. on management of data, ACM SIGMOD, Tucson, 13\u201315 May 1997, pp 1\u201312","DOI":"10.1145\/253260.253263"},{"key":"243_CR5","doi-asserted-by":"crossref","unstructured":"Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is nearest neighbor meaningful? In: Proc. int\u2019l. conf. on database theory, ICDT, Jerusalem, 10\u201312 January 1999, pp 217\u2013235","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"3","key":"243_CR6","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C B\u00f6hm","year":"2001","unstructured":"B\u00f6hm C, Berchtold S, Keim D (2001) Searching in high-dimensional spaces-index structures for improving the performance of multimedia databases. ACM Comput Surv 33(3):322\u2013373","journal-title":"ACM Comput Surv"},{"key":"243_CR7","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: Proc int\u2019l. conf. on very large data bases, VLDB, Athens, 25\u201329 August 1997, pp 426\u2013435"},{"key":"243_CR8","doi-asserted-by":"crossref","unstructured":"Egecioglu \u00d6 (2001) Parametric approximation algorithms for high-dimensional euclidean similarity. In: Proc. european conf. on principles of data mining and knowledge discovery, PKDD, Freiburg, 3\u20135 September 2001, pp 79\u201390","DOI":"10.1007\/3-540-44794-6_7"},{"issue":"6","key":"243_CR9","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/TKDE.2004.9","volume":"16","author":"\u00d6 Egecioglu","year":"2004","unstructured":"Egecioglu \u00d6, Ferhatosmanoglu H, Ogras U (2004) Dimensionality reduction and similarity computation by inner product approximations. IEEE Trans Knowl Data Eng 16(6):714\u2013726","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"243_CR10","unstructured":"Eidenberger H (2004) A new method for visual descriptor evaluation. In: Proc. SPIE storage and retrieval methods and applications for multimedia, San Jose, January 2004, pp 145\u2013157"},{"issue":"3\/4","key":"243_CR11","doi-asserted-by":"crossref","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 (1994) Efficient and effective querying by image content. J Intell Inf Syst 3(3\/4):231\u2013262","journal-title":"J Intell Inf Syst"},{"key":"243_CR12","doi-asserted-by":"crossref","unstructured":"Jeong S, Kim S-W, Kim K, Choi, B-U (2006) An effective method for approximating the euclidean distance in high-dimensional space. In: Proc. int\u2019l. conf. on databases and expert systems applications, Krakow, 4\u20138 September 2006, pp 863\u2013872","DOI":"10.1007\/11827405_84"},{"key":"243_CR13","unstructured":"Kanth KVR, Agrawal D, Singh A (1998) Dimensionality reduction for similarity searching in dynamic databases. In: Proc. int\u2019l. conf. on management of data, ACM SIGMOD, Seattle, 2\u20134 June 1998, pp 166\u2013176"},{"key":"243_CR14","doi-asserted-by":"crossref","unstructured":"Katayama N, Satoh S (1997) The SR-Tree: an index structure for high-dimensional nearest neighbor queries. In: Proc. int\u2019l. conf. on management of data, ACM SIGMOD, Tucson, 13\u201315 May 1997, pp 369\u2013380","DOI":"10.1145\/253260.253347"},{"key":"243_CR15","unstructured":"Krishnamachari S, Abdel-Mottaleb M (1999) Hierarchical clustering algorithm for fast image retrieval. In: Proc. SPIE int\u2019l. conf. on storage and retrieval for image and video databases, San Jose, 26\u201329 January 1999, pp 427\u2013435"},{"key":"243_CR16","doi-asserted-by":"crossref","unstructured":"Lee S-M, Abbott AL, Araman PA (2007) Dimensionality reduction and clustering on statistical manifolds. In: Proc. IEEE conf. on computer vision and pattern recognition, Minneapolis, 18\u201323 June 2007, pp 1\u20137","DOI":"10.1109\/CVPR.2007.383408"},{"issue":"4","key":"243_CR17","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K Lin","year":"1994","unstructured":"Lin K, Jagadish H, Faloutsos C (1994) The TV-Tree: an index structure for high dimensional data. VLDB J 3(4):517\u2013542","journal-title":"VLDB J"},{"key":"243_CR18","doi-asserted-by":"crossref","unstructured":"Lin T, Zha H, Lee SU (2006) Riemannian manifold learning for nonlinear dimensionality reduction. In: Proc. European conf. on computer vision, Graz, 7\u201313 May 2006, pp 44\u201355","DOI":"10.1007\/11744023_4"},{"key":"243_CR19","volume-title":"Signal analysis","author":"A Mertins","year":"2000","unstructured":"Mertins A (2000) Signal analysis. Wiley, New York"},{"key":"243_CR20","volume-title":"Mathematical methods and algorithms for signal processing","author":"TK Moon","year":"2000","unstructured":"Moon TK, Stirling WC (2000) Mathematical methods and algorithms for signal processing. Prentice-Hall, New York"},{"key":"243_CR21","doi-asserted-by":"crossref","unstructured":"Niblack W, Barber R, Equitz W, Flickner M, Glasman E, Petkovic D, Yanker P (1993) The QBIC project: querying images by content using color, texture, and shape. In: Proc. SPIE int\u2019l. conf. storage and retrieval for image and video databases, San Jose, 31 January\u20135 February 1993, pp 173\u2013187","DOI":"10.1117\/12.143648"},{"key":"243_CR22","doi-asserted-by":"crossref","unstructured":"Ogras U, Ferhatosmanoglu H (2003) Dimensionality reduction using magnitude and shape approximations. In: Proc. int\u2019l. conf. on information and knowledge management, ACM CIKM, New Orleans, 3\u20138 November 2003, pp 99\u2013107","DOI":"10.1145\/956863.956883"},{"key":"243_CR23","doi-asserted-by":"crossref","unstructured":"Pagel B-U, Six H-W, Winter M (1995) Window query-optimal clustering of spatial objects. In: Proc. int\u2019l. conf. on principals of database systems, pp 86\u201394","DOI":"10.1145\/212433.212458"},{"key":"243_CR24","volume-title":"Numerical recipes in C++","author":"WH Press","year":"2002","unstructured":"Press WH, Teukolsky SA, Vetterling WT, Flannery BP (2002) Numerical recipes in C++. Cambridge University Press, Cambridge"},{"key":"243_CR25","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"ST Roweis","year":"2000","unstructured":"Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290:2323\u20132326","journal-title":"Science"},{"key":"243_CR26","unstructured":"Seidl T, Kriegel H-P (1997) Efficient user-adaptable similarity search in large multimedia databases. In: Proc. int\u2019l. conf. on very large data bases, VLDB, pp 506\u2013515"},{"key":"243_CR27","doi-asserted-by":"crossref","unstructured":"Seidl T, Kriegel H-P (1998) Optimal multi-step k-nearest neighbor search. In: Proc. int\u2019l. conf. on management of data. ACM SIGMOD, pp 154\u2013165","DOI":"10.1145\/276304.276319"},{"key":"243_CR28","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum JB, De Silva V, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290:2319\u20132323","journal-title":"Science"},{"issue":"2","key":"243_CR29","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s11042-007-0179-7","volume":"38","author":"A Thomasian","year":"2008","unstructured":"Thomasian A, Zhang L (2008) Persistent clustered main memory index for accelerating k-NN queries on high dimensional datasets. Multimed Tools Appl 38(2):253\u2013270","journal-title":"Multimed Tools Appl"},{"issue":"2","key":"243_CR30","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s11042-008-0206-3","volume":"40","author":"A Thomasian","year":"2008","unstructured":"Thomasian A, Li Y, Zhang L (2008) Optimal subspace dimensionality for k-Nearest-neighbor queries on clusterd and dimensionality reduced datasets with SVD. Multimed Tools Appl 40(2):241\u2013259","journal-title":"Multimed Tools Appl"},{"key":"243_CR31","unstructured":"Weber R, Schek HJ, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proc. int\u2019l. conf. on very large data bases, VLDB, pp 194\u2013205"},{"key":"243_CR32","unstructured":"White DA, Jain R (1996) Similarity indexing with the SS-tree. In: Proc. IEEE int\u2019l. conf. on data engineering, pp 516\u2013523"},{"key":"243_CR33","doi-asserted-by":"crossref","unstructured":"Xiao L, Sun J, Boyd SP (2006) A duality view of spectral methods for dimensionality reduction. In: ICML2006, pp 1041\u20131048","DOI":"10.1145\/1143844.1143975"},{"key":"243_CR34","unstructured":"University of California (1999) Corel image features. http:\/\/kdd.ics.uci.edu\/databases\/CorelFeatures\/CorelFeatures.html"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-008-0243-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-008-0243-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-008-0243-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:27:50Z","timestamp":1559345270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-008-0243-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,21]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["243"],"URL":"https:\/\/doi.org\/10.1007\/s11042-008-0243-y","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,21]]}}}