{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T23:58:58Z","timestamp":1772236738025,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642229213","type":"print"},{"value":"9783642229220","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22922-0_25","type":"book-chapter","created":{"date-parts":[[2011,8,20]],"date-time":"2011-08-20T09:39:14Z","timestamp":1313833154000},"page":"422-440","source":"Crossref","is-referenced-by-count":7,"title":["Quality of Similarity Rankings in Time Series"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bernecker","sequence":"first","affiliation":[]},{"given":"Michael E.","family":"Houle","sequence":"additional","affiliation":[]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[]},{"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[]},{"given":"Erich","family":"Schubert","sequence":"additional","affiliation":[]},{"given":"Arthur","family":"Zimek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Berndt, D., Clifford, J.: Using dynamic time warping to find patterns in time series. In: KDD Workshop (1994)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Vlachos, M., Kollios, G., Gunopulos, D.: Discovering similar multidimensional trajectories. In: Proc. ICDE (2002)","DOI":"10.1109\/ICDE.2002.994784"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Chen, L., \u00d6zsu, M.T., Oria, V.: Robust and fast similarity search for moving object trajectories. In: Proc. SIGMOD (2005)","DOI":"10.1145\/1066157.1066213"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Chen, L., Ng, R.: On the marriage of Lp-norms and edit distance. In: Proc. VLDB (2004)","DOI":"10.1016\/B978-012088469-8.50070-X"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Foundations of Data Organization and Algorithms","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Faloutsos, C., Swami, A.: Efficient similarity search in sequence databases. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol.\u00a0730. Springer, Heidelberg (1993)"},{"key":"25_CR6","unstructured":"Yi, B.K., Jagadish, H., Faloutsos, C.: Fast time sequence indexing for arbitrary Lp norms. In: Proc. VLDB (2000)"},{"issue":"1","key":"25_CR7","first-page":"90","volume":"23","author":"N. Ahmed","year":"1974","unstructured":"Ahmed, N., Natarajan, T., Rao, K.R.: Discrete cosine transform. IEEE TC\u00a023(1), 90\u201393 (1974)","journal-title":"IEEE TC"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Chan, K.P., Fu, A.W.C.: Efficient time series matching by wavelets. In: Proc. ICDE, pp. 126\u2013133 (1999)","DOI":"10.1109\/ICDE.1999.754915"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Cai, Y., Ng, R.: Index spatio-temporal trajectories with Chebyshev polynomials. In: Proc. SIGMOD (2004)","DOI":"10.1145\/1007568.1007636"},{"issue":"1","key":"25_CR10","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. IEEE TKDD\u00a03(1), 1\u201358 (2009)","journal-title":"IEEE TKDD"},{"issue":"11","key":"25_CR11","first-page":"1025","volume":"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"},{"key":"25_CR12","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"},{"issue":"3","key":"25_CR13","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":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1007\/978-3-642-01307-2_86","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H.P. Kriegel","year":"2009","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Schubert, E., Zimek, A.: Outlier detection in axis-parallel subspaces of high dimensional data. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS, vol.\u00a05476, pp. 831\u2013838. Springer, Heidelberg (2009)"},{"key":"25_CR15","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":"M.E. 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.\u00a06187, pp. 482\u2013500. Springer, Heidelberg (2010)"},{"key":"25_CR16","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":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-642-02982-0_35","volume-title":"Advances in Spatial and Temporal Databases","author":"E. Achtert","year":"2009","unstructured":"Achtert, E., Bernecker, T., Kriegel, H.P., Schubert, E., Zimek, A.: ELKI in time: ELKI 0.2 for the performance evaluation of distance measures for time series. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) SSTD 2009. LNCS, vol.\u00a05644, pp. 436\u2013440. Springer, Heidelberg (2009)"},{"key":"25_CR18","unstructured":"Keogh, E., Xi, X., Wei, L., Ratanamahatana, C.A.: The UCR time series classification\/clustering homepage (2006), http:\/\/www.cs.ucr.edu\/~eamonn\/time_series_data\/"},{"key":"25_CR19","unstructured":"Saito, N.: Local feature extraction and its application using a library of bases. PhD thesis, Yale University (1994)"},{"issue":"2","key":"25_CR20","first-page":"115","volume":"212","author":"D.T. Pham","year":"1998","unstructured":"Pham, D.T., Chan, A.B.: Control chart pattern recognition using a new type of self-organizing neural network. Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering\u00a0212(2), 115\u2013127 (1998)","journal-title":"Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering"},{"key":"25_CR21","unstructured":"Gandhi, A.: Content-based image retrieval: Plant species identification. Master\u2019s thesis, Oregon State University (2002)"},{"key":"25_CR22","unstructured":"Davis, S., Jacobson, A., Suszcynsky, D., Cai, M., Eads, D.: FORTE forte time series dataset (2005), http:\/\/nis-www.lanl.gov\/~eads\/datasets\/forte"},{"key":"25_CR23","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":"25_CR24","unstructured":"Hinneburg, A., Aggarwal, C.C., Keim, D.A.: What is the nearest neighbor in high dimensional spaces? In: Proc. VLDB (2000)"},{"key":"25_CR25","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":"2","key":"25_CR26","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1145\/568518.568520","volume":"27","author":"K. Chakrabarti","year":"2002","unstructured":"Chakrabarti, K., Keogh, E., Mehrotra, S., Pazzani, M.: Locally adaptive dimensionality reduction for indexing large time series databases. ACM TODS\u00a027(2), 188\u2013228 (2002)","journal-title":"ACM TODS"},{"key":"25_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/11494669_93","volume-title":"Computational Intelligence and Bioinspired Systems","author":"M. Verleysen","year":"2005","unstructured":"Verleysen, M., Fran\u00e7ois, D.: The curse of dimensionality in data mining and time series prediction. In: Cabestany, J., Prieto, A.G., Sandoval, F. (eds.) IWANN 2005. LNCS, vol.\u00a03512, pp. 758\u2013770. Springer, Heidelberg (2005)"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Radovanovic, M., Nanopoulos, A., Ivanovic, M.: Time-series classification in many intrinsic dimensions. In: Proc. SDM (2010)","DOI":"10.1137\/1.9781611972801.59"},{"key":"25_CR29","first-page":"2487","volume":"11","author":"M. Radovanovic","year":"2010","unstructured":"Radovanovic, M., Nanopoulos, A., Ivanovic, M.: Hubs in space: Popular nearest neighbors in high-dimensional data. J. Mach. Learn. Res.\u00a011, 2487\u20132531 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"25_CR30","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"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22922-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T23:41:30Z","timestamp":1741477290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22922-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229213","9783642229220"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22922-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}