{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:57:51Z","timestamp":1742997471892,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319250861"},{"type":"electronic","value":"9783319250878"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25087-8_29","type":"book-chapter","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T14:11:35Z","timestamp":1444140695000},"page":"307-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Subspace Nearest Neighbor Search - Problem Statement, Approaches, and Discussion"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hund","sequence":"first","affiliation":[]},{"given":"Michael","family":"Behrisch","sequence":"additional","affiliation":[]},{"given":"Ines","family":"F\u00e4rber","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Sedlmair","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"Schreck","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Keim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,17]]},"reference":[{"issue":"6","key":"29_CR1","first-page":"734","volume":"17","author":"G Adomavicius","year":"2005","unstructured":"Adomavicius, G., Tuzhilin, A.: Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE TKDE 17(6), 734\u2013749 (2005)","journal-title":"IEEE TKDE"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201cnearest neighbor\u201d meaningful? In: Proc. 7th Int. Conf. Database Theory, pp. 217\u2013235 (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"12","key":"29_CR3","doi-asserted-by":"publisher","first-page":"2945","DOI":"10.1016\/S0031-3203(03)00176-6","volume":"36","author":"F Camastra","year":"2003","unstructured":"Camastra, F.: Data dimensionality estimation methods: a survey. Pattern Recognition 36(12), 2945\u20132954 (2003)","journal-title":"Pattern Recognition"},{"issue":"4","key":"29_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1177\/1473871611416549","volume":"10","author":"M Gleicher","year":"2011","unstructured":"Gleicher, M., Albers, D., Walker, R., Jusufi, I., Hansen, C.D., Roberts, J.C.: Visual comparison for information visualization. Information Visualization 10(4), 289\u2013309 (2011)","journal-title":"Information Visualization"},{"key":"29_CR5","unstructured":"Hinneburg, A., Keim, D.A., Aggarwal, C.C.: What is the nearest neighbor in high dimensional spaces? In: Proc. 26th Int. Conf. on VLDB, Cairo, Egypt (2000)"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-13818-8_34","volume-title":"Scientific and Statistical Database Management","author":"ME Houle","year":"2010","unstructured":"Houle, M.E., Kriegel, H.-P., Kr\u00f6ger, P., Schubert, E., Zimek, A.: Can shared-neighbor distances defeat the curse of dimensionality? In: Gertz, M., Lud\u00e4scher, B. (eds.) SSDBM 2010. LNCS, vol. 6187, pp. 482\u2013500. Springer, Heidelberg (2010)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Similarity Search and Applications","author":"ME Houle","year":"2014","unstructured":"Houle, M.E., Ma, X., Oria, V., Sun, J.: Efficient algorithms for similarity search in axis-aligned subspaces. In: Traina, A.J.M., Traina Jr, C., Cordeiro, R.L.F. (eds.) SISAP 2014. LNCS, vol. 8821, pp. 1\u201312. Springer, Heidelberg (2014)"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-39804-2_23","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"K Kailing","year":"2003","unstructured":"Kailing, K., Kriegel, H.-P., Kr\u00f6ger, P., Wanka, S.: Ranking interesting subspaces for clustering high dimensional data. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol. 2838, pp. 241\u2013252. Springer, Heidelberg (2003)"},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"HP 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 3(1), 1 (2009)","journal-title":"ACM TKDD"},{"key":"29_CR10","unstructured":"Liu, H., Motoda, H.: Computational Methods of Feature Selection. Data Mining and Knowledge Discovery Series. Chapman & Hall\/CRC Press (2007)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Micenkova, B., Dang, X.H., Assent, I., Ng, R.: Explaining outliers by subspace separability. In: 13th. IEEE ICDM, pp. 518\u2013527 (2013)","DOI":"10.1109\/ICDM.2013.132"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"M\u00fcller, E., G\u00fcnnemann, S., Assent, I., Seidl, T.: Evaluating clustering in subspace projections of high dimensional data. In: VLDB, vol. 2, pp. 1270\u20131281 (2009)","DOI":"10.14778\/1687627.1687770"},{"issue":"5","key":"29_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1002\/sam.11161","volume":"5","author":"A Zimek","year":"2012","unstructured":"Zimek, A., Schubert, E., Kriegel, H.P.: A survey on unsupervised outlier detection in high-dimensional numerical data. Statistical Analysis and Data Mining 5(5), 363\u2013387 (2012)","journal-title":"Statistical Analysis and Data Mining"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25087-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T23:55:59Z","timestamp":1559260559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25087-8_29"}},"subtitle":["Position Paper"],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319250861","9783319250878"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25087-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 October 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}