{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:39:17Z","timestamp":1742395157948},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210474"},{"type":"electronic","value":"9783540245711"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24571-1_73","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T15:32:42Z","timestamp":1294414362000},"page":"831-842","source":"Crossref","is-referenced-by-count":3,"title":["Similarity Search and Dimensionality Reduction: Not All Dimensions Are Equally Useful"],"prefix":"10.1007","author":[{"given":"Christian","family":"Digout","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario A.","family":"Nascimento","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandru","family":"Coman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"73_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-44503-X_27","volume-title":"Database Theory - ICDT 2001","author":"C.C. Aggarwal","year":"2000","unstructured":"Aggarwal, C.C., Hinneburg, A., Keim, D.A.: On the surprising behavior of distance metrics in high dimensional space. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol.\u00a01973, pp. 420\u2013434. Springer, Heidelberg (2000)"},{"key":"73_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Faloutsos, C., Swami, A.N.: Efficient Similarity Search In Sequence Databases. In: Proc. of the 4th Intl. Conf. of Foundations of Data Organization and Algorithms, pp. 69\u201384 (1993)","DOI":"10.1007\/3-540-57301-1_5"},{"key":"73_CR3","doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R., Cunto, W., Manber, U., Wu, S.: Proximity matching using fixed queries trees. In: Proc. of the 5th Symposium on Combinatorial Pattern Matching, pp. 198\u2013212 (1994)","DOI":"10.1007\/3-540-58094-8_18"},{"key":"73_CR4","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An index structure for high-dimensional data. In: Proc. of the 22nd Intl. Conf. on Very Large Databases, pp. 28\u201339 (1996)"},{"key":"73_CR5","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 \u201cnearest neighbor\u201d meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"key":"73_CR6","doi-asserted-by":"crossref","unstructured":"Bozkaya, T., Ozsoyoglu, M.: Distance-based indexing for high-dimensional metric spaces. In: Proc. of the 1997 ACM SIGMOD Intl. Conf. on Management of Data, pp. 357\u2013368 (1997)","DOI":"10.1145\/253260.253345"},{"issue":"1","key":"73_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1109\/69.908982","volume":"13","author":"B. Braunmuller","year":"2001","unstructured":"Braunmuller, B., Ester, M., Kriegel, H.-P., Sander, J.: Multiple similarity queries: A basic DBMS operation for mining in metric databases. IEEE Transactions on Knowledge and Data Engineering\u00a013(1), 79\u201395 (2001)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"73_CR8","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proc. of 23rd Intl. Conf. on Very Large Data Bases, pp. 426\u2013435 (1997)"},{"key":"73_CR9","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc. of the 2nd Intl. Conf. on Knowledge Discovery and Data Mining, pp. 226\u2013231 (1996)"},{"key":"73_CR10","doi-asserted-by":"crossref","unstructured":"Santos Filho, R.F., Traina, A., Traina Jr., C., Faloutsos, C.: Similarity search without tears: The OMNI family of all-purpose access methods. In: Proc. of the 17th Intl. Conf. on Data Engineering, pp. 623\u2013630 (2001)","DOI":"10.1109\/ICDE.2001.914877"},{"key":"73_CR11","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. of ACM SIGMOD Intl. Conf. on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"issue":"2","key":"73_CR12","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/69.991715","volume":"14","author":"C. Traina Jr.","year":"2002","unstructured":"Traina Jr., C., Traina, A., Faloutsos, C., Seeger, B.: Fast indexing and visualization for metric data sets using slim-trees. IEEE Transactions on Knowledge and Data Engineering\u00a014(2), 244\u2013260 (2002)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"73_CR13","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The SR-tree: An index structure for high-dimensional nearest neighbor queries. In: Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pp. 369\u2013380 (1997)","DOI":"10.1145\/253260.253347"},{"key":"73_CR14","doi-asserted-by":"crossref","unstructured":"Liao, L., Noble, W.S.: Combining pairwise sequence similarity and support vector machinesfor remote protein homology detection. In: Proc. of the 6th Intl. Conf. on Research in Computational Molecular Biology, pp. 225\u2013232 (2002)","DOI":"10.1145\/565196.565225"},{"key":"73_CR15","volume-title":"Multimedia Database Management Systems","author":"G. Lu","year":"1999","unstructured":"Lu, G.: Multimedia Database Management Systems. Artech House, Norwood (1999)"},{"key":"73_CR16","unstructured":"Sakurai, Y., Yoshikawa, M., Uemura, S., Kojima, H.: The A-tree: An index structure for high-dimensional spaces using relative approximation. In: Proc. of the 26th Intl. Conf. on Very Large Data Bases, pp. 516\u2013526 (2000)"},{"key":"73_CR17","doi-asserted-by":"crossref","unstructured":"Stehling, R.O., Nascimento, M.A., Falc\u00e3o, A.X.: MiCRoM: A metric distance to compare segmented images. In: Proc. of the 2002 Visual Information Systems Conf., pp. 12\u201323 (2002)","DOI":"10.1007\/3-540-45925-1_2"},{"key":"73_CR18","doi-asserted-by":"crossref","unstructured":"Stehling, R.O., Nascimento, M.A., Falc\u00e3o, A.X.: A compact and efficient image retrieval approach based on border\/interior pixel classification. In: Proc. of the 2002 ACM Intl. Conf. on Information and Knowledge Management, pp. 102\u2013109 (2002)","DOI":"10.1145\/584792.584812"},{"issue":"1","key":"73_CR19","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00130487","volume":"7","author":"M.J. Swain","year":"1991","unstructured":"Swain, M.J., Ballard, D.H.: Color indexing. Intl. Journal of Computer Vision\u00a07(1), 11\u201332 (1991)","journal-title":"Journal of Computer Vision"},{"key":"73_CR20","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 the 24th Intl. Conf. on Very Large Databases, pp. 194\u2013205 (1998)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24571-1_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T17:42:22Z","timestamp":1559929342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24571-1_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210474","9783540245711"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24571-1_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}