{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:02:13Z","timestamp":1759683733457},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642138171"},{"type":"electronic","value":"9783642138188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13818-8_38","type":"book-chapter","created":{"date-parts":[[2010,6,24]],"date-time":"2010-06-24T16:58:03Z","timestamp":1277398683000},"page":"555-564","source":"Crossref","is-referenced-by-count":8,"title":["Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bernecker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Emrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franz","family":"Graf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erich","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arthur","family":"Zimek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","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":"38_CR2","doi-asserted-by":"crossref","unstructured":"Bennett, K.P., Fayyad, U., Geiger, D.: Density-based indexing for approximate nearest-neighbor queries. In: Proc. KDD (1999)","DOI":"10.1145\/312129.312236"},{"key":"38_CR3","unstructured":"Hinneburg, A., Aggarwal, C.C., Keim, D.A.: What is the nearest neighbor in high dimensional spaces? In: Proc. VLDB (2000)"},{"key":"38_CR4","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.: On the surprising behavior of distance metrics in high dimensional space. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol.\u00a01973, p. 420. Springer, Heidelberg (2000)"},{"issue":"7","key":"38_CR5","first-page":"873","volume":"19","author":"D. Francois","year":"2007","unstructured":"Francois, D., Wertz, V., Verleysen, M.: The concentration of fractional distances. IEEE TKDE\u00a019(7), 873\u2013886 (2007)","journal-title":"IEEE TKDE"},{"key":"38_CR6","unstructured":"Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proc. VLDB (1998)"},{"issue":"1","key":"38_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/373626.373638","volume":"30","author":"C.C. Aggarwal","year":"2001","unstructured":"Aggarwal, C.C.: Re-designing distance functions and distance-based applications for high dimensional data. SIGMOD Record\u00a030(1), 13\u201318 (2001)","journal-title":"SIGMOD Record"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: Distinctiveness-sensitive nearest-neighbor search for efficient similarity retrieval of multimedia information. In: Proc. ICDE (2001)","DOI":"10.1109\/ICDE.2001.914863"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Jagadish, H.V., Kriegel, H.P., Sander, J.: Independent Quantization: An index compression technique for high-dimensional data spaces. In: Berchtold, S., B\u00f6hm, C., Jagadish, H.V., Kriegel, H.P., Sander, J. (eds.) Proc. ICDE (2000)","DOI":"10.1109\/ICDE.2000.839456"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Jin, H., Ooi, B.C., Shen, H.T., Yu, C., Zhou, A.Y.: An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing. In: Proc. ICDE (2003)","DOI":"10.1109\/ICDE.2003.1260784"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Dittrich, J., Blunschi, L., Salles, M.A.V.: Dwarfs in the rearview mirror: How big are they really? In: Proc. VLDB (2008)","DOI":"10.14778\/1454159.1454230"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Yu, P.S.: On high dimensional indexing of uncertain data. In: Proc. ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497589"},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1007\/978-3-540-27814-6_60","volume-title":"Image and Video Retrieval","author":"M. Koskela","year":"2004","unstructured":"Koskela, M., Laaksonen, J., Oja, E.: Use of image subset features in image retrieval with self-organizing maps. In: Enser, P.G.B., Kompatsiaris, Y., O\u2019Connor, N.E., Smeaton, A., Smeulders, A.W.M. (eds.) CIVR 2004. LNCS, vol.\u00a03115, pp. 508\u2013516. Springer, Heidelberg (2004)"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"He, X.: Incremental semi-supervised subspace learning for image retrieval. In: Proc. ACM MM (2005)","DOI":"10.1145\/1027527.1027530"},{"issue":"1","key":"38_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"H.P. Kriegel","year":"2009","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Zimek, A.: Clustering high dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM TKDD\u00a03(1), 1\u201358 (2009)","journal-title":"ACM TKDD"},{"key":"38_CR16","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1162\/153244303322753616","volume":"3","author":"I. Guyon","year":"2003","unstructured":"Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res.\u00a03, 1157\u20131182 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Bernecker, T., Emrich, T., Graf, F., Kriegel, H.P., Kr\u00f6ger, P., Renz, M., Schubert, E., Zimek, A.: Subspace similarity search using the ideas of ranking and top-k retrieval. In: Proc. ICDE Workshop DBRank (2010)","DOI":"10.1109\/ICDEW.2010.5452771"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A dynamic index structure for spatial searching. In: Proc. SIGMOD (1984)","DOI":"10.1145\/602259.602266"},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-Tree: An efficient and robust access method for points and rectangles. In: Proc. SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"38_CR20","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-Tree: An index structure for high-dimensional data. Proc. VLDB (1996)"},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The SR-tree: An index structure for high-dimensional nearest neighbor queries. In: Proc. SIGMOD (1997)","DOI":"10.1145\/253260.253347"},{"key":"38_CR22","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"H. Samet","year":"2006","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, San Francisco (2006)"},{"key":"38_CR23","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Schubert, M., Zhu, Z.: Efficient query processing in arbitrary subspaces using vector approximations. In: Proc. SSDBM (2006)","DOI":"10.1109\/SSDBM.2006.23"},{"key":"38_CR24","doi-asserted-by":"crossref","unstructured":"Lian, X., Chen, L.: Similarity search in arbitrary subspaces under Lp-norm. In: Proc. ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497440"},{"issue":"4","key":"38_CR25","first-page":"614","volume":"66","author":"R. Fagin","year":"2003","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. JCSS\u00a066(4), 614\u2013656 (2003)","journal-title":"JCSS"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13818-8_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:44:13Z","timestamp":1606185853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13818-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642138171","9783642138188"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13818-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}