乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T09:51:45Z","timestamp":1722333105193},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1016\/j.ipl.2008.08.003","type":"journal-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T08:11:48Z","timestamp":1218615108000},"page":"1-12","source":"Crossref","is-referenced-by-count":5,"title":["Efficient indexing of interval time sequences"],"prefix":"10.1016","volume":"109","author":[{"given":"Jong-Won","family":"Roh","sequence":"first","affiliation":[]},{"given":"Byoung-Kee","family":"Yi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2008.08.003_bib001","doi-asserted-by":"crossref","unstructured":"R. Agrawal, C. Faloutsos, A. Swami, Efficient similarity search in sequence databases, in: Proc. of FODO Conf., Evanston, IL, USA, 1993, pp. 69\u201384","DOI":"10.1007\/3-540-57301-1_5"},{"key":"10.1016\/j.ipl.2008.08.003_bib002","doi-asserted-by":"crossref","unstructured":"C. Faloutsos, M. Ranganathan, Y. Manolopoulos, Fast subsequence matching in time-series databases, in: Proc. of the ACM SIGMOD Conf., 1994, pp. 419\u2013429","DOI":"10.1145\/191843.191925"},{"key":"10.1016\/j.ipl.2008.08.003_bib003","doi-asserted-by":"crossref","unstructured":"D. Rafiei, A. Mendelzon, Similarity-based queries for time series data, in: Proc. of ACM SIGMOD Conf., Tucson, AZ, 1997, pp. 13\u201325","DOI":"10.1145\/253262.253264"},{"key":"10.1016\/j.ipl.2008.08.003_bib004","unstructured":"B.-K. Yi, H. Jagadish, C. Faloutsos, Efficient retrieval of similar time sequences under time warping, in: IEEE Proc. of ICDE, Orlando, Florida, USA, 1998, pp. 201\u2013208"},{"issue":"2","key":"10.1016\/j.ipl.2008.08.003_bib005","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/568518.568520","article-title":"Locally adaptive dimensionality reduction for indexing large time series databases","volume":"27","author":"Chakrabarti","year":"2002","journal-title":"ACM Transactions on Database Systems"},{"key":"10.1016\/j.ipl.2008.08.003_bib006","unstructured":"B.-K. Yi, C. Faloutsos, Fast time sequence indexing for arbitrary lp norms, in: Proc. of VLDB Conf., Cairo, Egypt, 2000, pp. 385\u2013394"},{"issue":"3","key":"10.1016\/j.ipl.2008.08.003_bib007","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011669","article-title":"Dimensionality reduction for fast similarity search in large time series databases","volume":"3","author":"Keogh","year":"2001","journal-title":"Knowledge and Information Systems"},{"key":"10.1016\/j.ipl.2008.08.003_bib008","unstructured":"S.-L. Lee, S.-J. Chun, D.-H. Kim, J.-H. Lee, C.-W. Chung, Similarity search for multidimensional data sequences, in: Proc. of ICDE, 2000, pp. 599\u2013608"},{"key":"10.1016\/j.ipl.2008.08.003_bib009","unstructured":"T. Kahveci, A.K. Singh, A. Gurel, Similarity searching for multi-attribute sequences, in: Proc. of SSDBM, Edinburgh, Scotland, 2002, pp. 175\u2013184"},{"key":"10.1016\/j.ipl.2008.08.003_bib010","unstructured":"M. Vlachos, G. Kollios, D. Gunopulo, Discovering similar multidimensional trajectories, in: Proc. of ICDE, San Jose, CA, 2002, pp. 673\u2013684"},{"key":"10.1016\/j.ipl.2008.08.003_bib011","doi-asserted-by":"crossref","unstructured":"M. Vlachos, M. Hadjieleftheriou, D. Gunopulos, E. Keogh, Indexing multi-dimensional time-series with support for multiple distance measures, in: Proc. of SIGKDD, Washington, DC, 2003, pp. 216\u2013225","DOI":"10.1145\/956755.956777"},{"issue":"1","key":"10.1016\/j.ipl.2008.08.003_bib012","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/69.908983","article-title":"On the dimensionality curse and the self-similarity blessing","volume":"13","author":"Korn","year":"2001","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.ipl.2008.08.003_bib013","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger, The r\u2217-tree: an efficient and robust access method for points and rectangles, in: Proc. of ACM SIGMOD Conf., Atlantic City, NJ, 1990, pp. 322\u2013331","DOI":"10.1145\/93605.98741"},{"key":"10.1016\/j.ipl.2008.08.003_bib014","unstructured":"Y.-S. Moon, K.-Y. Whang, W.-K. Loh, Duality-based subsequence matching in time-series databases, in: IEEE Proc. of ICDE, D\u00fcsseldorf, Germany, 2001, pp. 263\u2013272"},{"key":"10.1016\/j.ipl.2008.08.003_bib015","doi-asserted-by":"crossref","unstructured":"Y.-S. Moon, K.-Y. Whang, W.-S. Han, General match: a subsequence matching method in time-series databases based on generalized windows, in: Proc. of ACM SIGMOD Conf., Madison, Wisconsin, USA, 2002, pp. 382\u2013393","DOI":"10.1145\/564691.564735"},{"issue":"2","key":"10.1016\/j.ipl.2008.08.003_bib016","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.ic.2004.07.001","article-title":"Bounded similarity querying for time-series data","volume":"194","author":"Goldin","year":"2004","journal-title":"Information and Computation"},{"key":"10.1016\/j.ipl.2008.08.003_bib017","series-title":"Information Retrieval","author":"van Rijsbergen","year":"1979"},{"issue":"3","key":"10.1016\/j.ipl.2008.08.003_bib018","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(91)90233-8","article-title":"Computing the minimum Hausdorff distance between two point sets on a line under translation","volume":"38","author":"Rote","year":"1991","journal-title":"Information Processing Letters"},{"issue":"2","key":"10.1016\/j.ipl.2008.08.003_bib019","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s00180-006-0260-0","article-title":"New clustering methods for interval data","volume":"21","author":"Chavent","year":"2006","journal-title":"Comput. Stat."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019008002263?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019008002263?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T08:39:53Z","timestamp":1557736793000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019008002263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["S0020019008002263"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2008.08.003","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}