{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T02:50:23Z","timestamp":1774925423274,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642138171","type":"print"},{"value":"9783642138188","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13818-8_34","type":"book-chapter","created":{"date-parts":[[2010,6,24]],"date-time":"2010-06-24T16:58:03Z","timestamp":1277398683000},"page":"482-500","source":"Crossref","is-referenced-by-count":150,"title":["Can Shared-Neighbor Distances Defeat the Curse of Dimensionality?"],"prefix":"10.1007","author":[{"given":"Michael E.","family":"Houle","sequence":"first","affiliation":[]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[]},{"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[]},{"given":"Erich","family":"Schubert","sequence":"additional","affiliation":[]},{"given":"Arthur","family":"Zimek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_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":"34_CR2","unstructured":"Hinneburg, A., Aggarwal, C.C., Keim, D.A.: What is the nearest neighbor in high dimensional spaces? In: Proc. VLDB (2000)"},{"key":"34_CR3","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)"},{"key":"34_CR4","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"},{"issue":"1","key":"34_CR5","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"},{"issue":"1","key":"34_CR6","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":"34_CR7","doi-asserted-by":"crossref","unstructured":"Domeniconi, C., Papadopoulos, D., Gunopulos, D., Ma, S.: Subspace clustering of high dimensional data. In: Proc. SDM (2004)","DOI":"10.1137\/1.9781611972740.58"},{"issue":"4","key":"34_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.infsof.2003.07.003","volume":"46","author":"K.G. Woo","year":"2004","unstructured":"Woo, K.G., Lee, J.H., Kim, M.H., Lee, Y.J.: FINDIT: a fast and intelligent subspace clustering algorithm using dimension voting. Inform. Software Technol.\u00a046(4), 255\u2013271 (2004)","journal-title":"Inform. Software Technol."},{"issue":"1","key":"34_CR9","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L. Parsons","year":"2004","unstructured":"Parsons, L., Haque, E., Liu, H.: Subspace clustering for high dimensional data: A review. SIGKDD Explorations\u00a06(1), 90\u2013105 (2004)","journal-title":"SIGKDD Explorations"},{"issue":"2","key":"34_CR10","first-page":"176","volume":"17","author":"M.L. Yiu","year":"2005","unstructured":"Yiu, M.L., Mamoulis, N.: Iterative projected clustering by subspace mining. IEEE TKDE\u00a017(2), 176\u2013189 (2005)","journal-title":"IEEE TKDE"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Liu, G., Li, J., Sim, K., Wong, L.: Distance based subspace clustering with flexible dimension partitioning. In: Proc. ICDE (2007)","DOI":"10.1109\/ICDE.2007.368985"},{"key":"34_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-540-69497-7_27","volume-title":"Scientific and Statistical Database Management","author":"H.P. Kriegel","year":"2008","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Schubert, E., Zimek, A.: A general framework for increasing the robustness of PCA-based correlation clustering algorithms. In: Lud\u00e4scher, B., Mamoulis, N. (eds.) SSDBM 2008. LNCS, vol.\u00a05069, pp. 418\u2013435. Springer, Heidelberg (2008)"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Moise, G., Sander, J.: Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering. In: Proc. KDD (2008)","DOI":"10.1145\/1401890.1401956"},{"issue":"3","key":"34_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/sam.10012","volume":"1","author":"E. Achtert","year":"2008","unstructured":"Achtert, E., B\u00f6hm, C., David, J., Kr\u00f6ger, P., Zimek, A.: Global correlation clustering based on the Hough transform. Stat. Anal. Data Min.\u00a01(3), 111\u2013127 (2008)","journal-title":"Stat. Anal. Data Min."},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Yu, P.S.: Outlier detection for high dimensional data. In: Proc. SIGMOD (2001)","DOI":"10.1145\/375663.375668"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Zhu, C., Kitagawa, H., Faloutsos, C.: Example-based robust outlier detection in high dimensional datasets. In: Proc. ICDM (2005)","DOI":"10.2197\/ipsjdc.1.234"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Schubert, M., Zimek, A.: Angle-based outlier detection in high-dimensional data. In: Proc. KDD (2008)","DOI":"10.1145\/1401890.1401946"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"M\u00fcller, E., Assent, I., Steinhausen, U., Seidl, T.: OutRank: ranking outliers in high dimensional data. In: Proc. ICDE Workshop DBRank (2008)","DOI":"10.1109\/ICDEW.2008.4498387"},{"key":"34_CR19","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":"34_CR20","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Yu, P.S.: Finding generalized projected clusters in high dimensional space. In: Proc. SIGMOD (2000)","DOI":"10.1145\/342009.335383"},{"key":"34_CR21","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: Proc. ICDE (2000)"},{"key":"34_CR22","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":"34_CR23","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"},{"issue":"7","key":"34_CR24","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":"34_CR25","doi-asserted-by":"crossref","unstructured":"Ert\u00f6z, L., Steinbach, M., Kumar, V.: Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. In: Proc. SDM (2003)","DOI":"10.1137\/1.9781611972733.5"},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Houle, M.E.: Navigating massive data sets via local clustering. In: Proc. KDD (2003)","DOI":"10.1145\/956750.956817"},{"key":"34_CR27","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., Shim, K.: CURE: An efficient clustering algorithm for large databases. In: Proc. SIGMOD, pp. 73\u201384 (1998)","DOI":"10.1145\/276304.276312"},{"issue":"11","key":"34_CR28","first-page":"1025","volume":"C-22","author":"R.A. Jarvis","year":"1973","unstructured":"Jarvis, R.A., Patrick, E.A.: Clustering using a similarity measure based on shared near neighbors. IEEE TC\u00a0C-22(11), 1025\u20131034 (1973)","journal-title":"IEEE TC"},{"issue":"3","key":"34_CR29","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/sam.10013","volume":"1","author":"M.E. Houle","year":"2008","unstructured":"Houle, M.E.: The relevant-set correlation model for data clustering. Stat. Anal. Data Min.\u00a01(3), 157\u2013176 (2008)","journal-title":"Stat. Anal. Data Min."},{"key":"34_CR30","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Schubert, E., Zimek, A.: Outlier detection in axis-parallel subspaces of high dimensional data. In: Proc. PAKDD (2009)","DOI":"10.1007\/978-3-642-01307-2_86"},{"key":"34_CR31","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Kamel, I.: Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension. In: Proc. SIGMOD (1994)","DOI":"10.1145\/182591.182593"},{"key":"34_CR32","unstructured":"Belussi, A., Faloutsos, C.: Estimating the selectivity of spatial queries using the \u2018correlation\u2019 fractal dimension. In: Proc. VLDB (1995)"},{"key":"34_CR33","doi-asserted-by":"crossref","unstructured":"Pagel, B.U., Korn, F., Faloutsos, C.: Deflating the dimensionality curse using multiple fractal dimensions. In: Proc. ICDE (2000)","DOI":"10.1109\/ICDE.2000.839457"},{"issue":"1","key":"34_CR34","first-page":"96","volume":"13","author":"F. Korn","year":"2001","unstructured":"Korn, F., Pagel, B.U., Falutsos, C.: On the \u201cdimensionality curse\u201d and the \u201cself-similarity blessing\u201d. IEEE TKDE\u00a013(1), 96\u2013111 (2001)","journal-title":"IEEE TKDE"},{"key":"34_CR35","unstructured":"Asuncion, A., Newman, D.J.: UCI Machine Learning Repository (2007), http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"issue":"1","key":"34_CR36","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1023\/B:VISI.0000042993.50813.60","volume":"61","author":"J.M. Geusebroek","year":"2005","unstructured":"Geusebroek, J.M., Burghouts, G.J., Smeulders, A.: The Amsterdam Library of Object Images. Int. J. Computer Vision\u00a061(1), 103\u2013112 (2005)","journal-title":"Int. J. Computer Vision"},{"key":"34_CR37","unstructured":"Boujemaa, N., Fauqueur, J., Ferecatu, M., Fleuret, F., Gouet, V., Saux, B.L., Sahbi, H.: IKONA: Interactive generic and specific image retrieval. In: Proc. MMCBIR, pp. 25\u201328 (2001)"}],"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_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:44:12Z","timestamp":1606185852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13818-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642138171","9783642138188"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13818-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}