{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:46:11Z","timestamp":1725489971927},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744672"},{"type":"electronic","value":"9783540744696"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74469-6_40","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T12:33:31Z","timestamp":1187786011000},"page":"404-413","source":"Crossref","is-referenced-by-count":2,"title":["Dimensionality Reduction in High-Dimensional Space for Multimedia Information Retrieval"],"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":"Byung-Uk","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C.: On the Effects of Dimensionality Reduction on High Dimensional Similarity Search. In: Proc. of Int\u2019l. Symp. on Principles of Database Systems, pp. 256\u2013266 (2001)","DOI":"10.1145\/375551.383213"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Faloutsos, C., Swami, A.: Efficient Similarity Search in Sequence Database. In: Proc. of Int\u2019l. Conf. on Foundations of Data Organization and Algorithms, pp. 69\u201384 (1993)","DOI":"10.1007\/3-540-57301-1_5"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When Is Nearest Neighbor Meaningful? In: Proc. of Int\u2019l. Conf. on Database Theory, pp. 217\u2013235 (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"3","key":"40_CR4","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":"40_CR5","doi-asserted-by":"crossref","unstructured":"Egecioglu, O., Ferhatosmanoglu, H., Ogras, U.: Dimensionality Reduction and Similarity Computation by Inner Product Approximations. IEEE Trans. on Knowledge and Data Engineering, 714\u2013726 (2004)","DOI":"10.1109\/TKDE.2004.9"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Jeong, S., Kim, S.-W., Kim, K., Choi, B.-U.: An Effective Method for Approximating the Euclidean Distance in High-Dimensional Space. In: Proc. of Int\u2019l. Conf. on Databases and Expert Systems Applications, pp. 863\u2013872 (2006)","DOI":"10.1007\/11827405_84"},{"key":"40_CR7","first-page":"166","volume-title":"Proc. of Int\u2019l. Conf. on Management of Data. ACM SIGMOD","author":"K.V.R. Kanth","year":"1998","unstructured":"Kanth, K.V.R., Agrawal, D., Singh, A.: Dimensionality Reduction for Similarity Searching in Dynamic Databases. In: Proc. of Int\u2019l. Conf. on Management of Data. ACM SIGMOD, pp. 166\u2013176. ACM Press, New York (1998)"},{"key":"40_CR8","volume-title":"Mathematical Methods and Algorithms for Signal Processing","author":"T.K. Moon","year":"2000","unstructured":"Moon, T.K., Stirling, W.C.: Mathematical Methods and Algorithms for Signal Processing. Prentice-Hall, Englewood Cliffs (2000)"},{"key":"40_CR9","unstructured":"Pagel, B.-U., Six, H-W., Winter, M.: Window Query-Optimal Clustering of Spatial Objects. In: Proc. of Int\u2019l. Conf. on Very Large Data Bases. VLDB., pp. 506\u2013515 (1997)"},{"key":"40_CR10","first-page":"154","volume-title":"Proc. of Int\u2019l. Conf. on Management of Data. ACM SIGMOD","author":"T. Seidl","year":"1998","unstructured":"Seidl, T., Kriegel, H.-P.: Optimal Multi-Step k-Nearest Neighbor Search. In: Proc. of Int\u2019l. Conf. on Management of Data. ACM SIGMOD, pp. 154\u2013165. ACM Press, New York (1998)"},{"key":"40_CR11","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 Int\u2019l. Conf. on Very Large Data Bases. VLDB., pp. 194\u2013205 (1998)"},{"key":"40_CR12","unstructured":"http:\/\/kdd.ics.uci.edu\/databases\/CorelFeatures\/CorelFeatures.html"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74469-6_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:31:03Z","timestamp":1619519463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74469-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744672","9783540744696"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74469-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}