{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:10:24Z","timestamp":1737288624252,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540419105"},{"type":"electronic","value":"9783540453574"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45357-1_38","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:49:49Z","timestamp":1184600989000},"page":"358-363","source":"Crossref","is-referenced-by-count":1,"title":["Micro Similarity Queries in Time Series Database"],"prefix":"10.1007","author":[{"given":"Xiao-ming","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuchang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunyi","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,4,11]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Rakesh A, Christos F, Efficient Similarity Search in Sequence Databases, FODO 1993, pages 69\u201384.","DOI":"10.1007\/3-540-57301-1_5"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"C. Faloutsos, M. Ranganathan, Y. Manolopoulos, Fast Subsequence Matching in Time-Series Database, Proc. of ACM SIGMOD 1994, Page 419\u2013429.","DOI":"10.1145\/191839.191925"},{"key":"38_CR3","unstructured":"Gautam D, King-IP L, Heikki M, Gopal R, Padhraic S. Rule Discovery from Time Series. Proc. of the 4th Intl. Conf. on KDD, 1998, pages 16\u201322."},{"key":"38_CR4","unstructured":"Hagit S, Stanley B.Z. Approximate Queries and Representations for Large Data Sequences. Proc. of the 12th Intl. Conf. on data engineering, 1996, pages 536\u2013545."},{"key":"38_CR5","unstructured":"R. Agrawal, K.I. Lin, H.S. Sawhney, K. Shim, Fast Similarity Search in the Presence of Noise, Scaling and Translation in Time-Series Databases, The 23rd Intl. Conf. on Very Large Data Bases, 1995, pages 490\u2013501."},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"D. Hull. Improving Text Retrieval for the Routing Problem Using Latent Semantic Indexing. In Proc. Of the 17th ACM-SIGIR Conference, 1994, pages 282\u2013291.","DOI":"10.1007\/978-1-4471-2099-5_29"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R* tree: An Efficient and Robust Access Method for Points and Rectabgles. Proc. Of ACM SIGMOD 1990, pages 322\u2013331","DOI":"10.1145\/93605.98741"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"D. White and R. Jain. Similarity Indexing with the SS-tree. Proc. Of 12th Int. Conf. On Data Engineering, 1996, pages 516\u2013523.","DOI":"10.1109\/ICDE.1996.492202"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45357-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:39:58Z","timestamp":1737286798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45357-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540419105","9783540453574"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45357-1_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}