{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:20:13Z","timestamp":1752549613608},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679806"},{"type":"electronic","value":"9783540444664"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44466-1_35","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:05:17Z","timestamp":1178355917000},"page":"347-357","source":"Crossref","is-referenced-by-count":1,"title":["AIM: Approximate Intelligent Matching for Time Series Data"],"prefix":"10.1007","author":[{"given":"Edward D.","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joyce M. W.","family":"Lam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,6]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"R. Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In Proc. 4th Int. Conf. Foundations of Data Organization and Algorithms, Chicago, Oct. 1993.","key":"35_CR1","DOI":"10.1007\/3-540-57301-1_5"},{"unstructured":"R. Agrawal, K.-I. Lin, H. Sawhney, and K. Shim. Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In Proc. 1995 Int. Conf. Very Large Data Bases (VLDB\u201995), pages 490\u2013501, Zurich, Switzerland, Sept. 1995.","key":"35_CR2"},{"doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. 1990 ACM SIGMOD Int. Conf. Management of Data (SIGMOD\u201990), pages 322\u2013331, Atlantic City, NJ, June 1990.","key":"35_CR3","DOI":"10.1145\/93597.98741"},{"unstructured":"K. Chan and A. Fu. Efficient time series matching by wavelets. In Proc. 1999 Int. Conf. on Data Engineering (ICDE\u201999), pages 126\u2013133, Sydney, Australia, Mar. 1999.","key":"35_CR4"},{"key":"35_CR5","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, Massachusetts, 1990."},{"unstructured":"G. Das, K. Lin, H. Mannila, G. Renganathan, and P. Smyth. Rule discovery from time series. In Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining (KDD\u201998), pages 16\u201322, New York, NY, Aug. 1998.","key":"35_CR6"},{"doi-asserted-by":"crossref","unstructured":"C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Proc. 1994 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD\u201994), pages 419\u2013429, Minneapolis, Minnesota, May 1994.","key":"35_CR7","DOI":"10.1145\/191839.191925"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"V. Gaede and O. G\u00fcnther. Multdimensional access methods. ACM Comput. Surv., 30:170\u2013231, 1998.","journal-title":"ACM Comput. Surv."},{"doi-asserted-by":"crossref","unstructured":"D. Q. Goldin and P. C. Kanellakis. On similarity queries for time-series data: Constraint specification and implementation. In Proc. 1995 Int. Conf. Principles and Practice of Constraint Programming, pages 137\u2013153, Marseilles, France, Sept. 1995.","key":"35_CR9","DOI":"10.1007\/3-540-60299-2_9"},{"unstructured":"E. Keogh and P. Smyth. A Probablistic Approach to Fast Pattern Matching in Time-Series Databases. In Proc. 1997 Int. Conf. on Knowledge Discovery and Data Mining (KDD\u201997), Newport Beach, California, Aug. 1997.","key":"35_CR10"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H. Mannila","year":"1997","unstructured":"H. Mannila, H. Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1:259\u2013289, 1997.","journal-title":"Data Mining and Knowledge Discovery"},{"doi-asserted-by":"crossref","unstructured":"D. Rafiei. On similarity-based queries for time series data. In Proc 1999 Int. Conf. on Data Engineering (ICDE\u201999), pages 410\u2013417, Sydney, Australia, Mar. 1999.","key":"35_CR12","DOI":"10.1109\/ICDE.1999.754957"},{"unstructured":"B.-K. Yi, H. V. Jagadish, and C. Faloutsos. Efficient retrieval of similar time sequences under time warping. In Proc. 1998 Int. Conf. Data Engineering (ICDE\u201998), pages 201\u2013208, Orlando, FL, Feb. 1998.","key":"35_CR13"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44466-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T09:24:46Z","timestamp":1550309086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44466-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679806","9783540444664"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44466-1_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}