{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T07:31:03Z","timestamp":1776583863199,"version":"3.51.2"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,11,23]],"date-time":"2006-11-23T00:00:00Z","timestamp":1164240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2006,12,4]]},"DOI":"10.1007\/s10115-006-0034-6","type":"journal-article","created":{"date-parts":[[2006,11,22]],"date-time":"2006-11-22T06:39:13Z","timestamp":1164177553000},"page":"1-27","source":"Crossref","is-referenced-by-count":139,"title":["Finding the most unusual time series subsequence: algorithms and applications"],"prefix":"10.1007","volume":"11","author":[{"given":"Eamonn","family":"Keogh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jessica","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Hee","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helga Van","family":"Herle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,23]]},"reference":[{"key":"34_CR1","unstructured":"Bentley JL, Sedgewick R (1997) Fast algorithms for sorting and searching strings. In: Proceedings of the 8th annual ACM-SIAM symposium on discrete algorithms, pp 360\u2013369"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Chen Z, Fu A, Tang J (2003) On complementarity of cluster and outlier detection schemes. In: Proceedings of data warehousing and knowledge discovery (DaWaK 2003), pp 234\u2013243","DOI":"10.1007\/978-3-540-45228-7_24"},{"key":"34_CR3","unstructured":"Chiu B, Keogh E, Lonardi S (2004) Probabilistic discovery of time series motifs. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, pp 493\u2013498"},{"key":"34_CR4","volume-title":"Introduction to algorithms","author":"TH Coerman","year":"2001","unstructured":"Coerman TH, Leiserson CE, Rivest RL, et al. (2001) Introduction to algorithms, 2nd edn. MIT Press, Cambridge, MA","edition":"2nd edn."},{"key":"34_CR5","unstructured":"Dasgupta D, Forrest S (1996) Novelty detection in time series data using ideas from immunology. In: Proceedings of the 5th international conference on intelligent systems, pp 87\u201392"},{"key":"34_CR6","unstructured":"Duchene F, Garbayl C, Rialle V (2004) Mining heterogeneous multivariate time-series for learning meaningful patterns: application to home health telecare. Laboratory TIMC-IMAG, Facult'e de m'edecine de Grenoble, France"},{"key":"34_CR7","volume-title":"Primate adaptation and evolution","author":"JG Fleagle","year":"1999","unstructured":"Fleagle JG (1999) Primate adaptation and evolution. Academic Press, San Diego, CA"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Gionis A, Mannila H (2003) Finding recurrent sources in sequences. In: Proceedings of the 7th annual international conference on research in computational molecular biology (RECOMB 2003), pp 123\u2013130","DOI":"10.1145\/640075.640091"},{"key":"34_CR9","unstructured":"Keogh E (2005) Availabe via http:\/\/www.cs.ucr.edu\/~eamonn\/discords\/"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Keogh E, Kasetty S (2002) On the need for time series data mining benchmarks: a survey and empirical demonstration. In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining, pp 102\u2013111","DOI":"10.1145\/775047.775062"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Keogh E, Lonardi S, Ratanamahatana C (2004) Towards parameter-free data mining. In: Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining, pp 206\u2013215","DOI":"10.1145\/1014052.1014077"},{"key":"34_CR12","unstructured":"Kitaguchi S (2004) Extracting feature based on motif from a chronic hepatitis dataset. In: Proceedings of the 18th annual conference of the Japanese society for artificial intelligence (JSAI)"},{"issue":"3\/4","key":"34_CR13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s007780050006","volume":"8","author":"E Knorr","year":"2000","unstructured":"Knorr E, Ng R, Tucakov V (2000) Distance-based outliers: algorithms and applications. VLDB J 8(3\/4):237\u2013253","journal-title":"VLDB J"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Kumar N, Lolla N, Keogh E, et al. (2005) Time-series bitmaps: a practical visualization tool for working with large time series databases. In: Proceedings of the 5th SIAM international conference on data mining, pp 531\u2013535","DOI":"10.1137\/1.9781611972757.55"},{"issue":"1","key":"34_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"JK Lanctot","year":"2003","unstructured":"Lanctot JK, Li M, Ma B, et al. (2003) Distinguishing string selection problems. Inf Comput 185(1):41\u201355","journal-title":"Inf Comput"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Lin J, Keogh E, Lonardi S, et al. (2003) A symbolic representation of time series, with implications for streaming algorithms. In: Proceedings of the 8th ACM SIGMOD workshop on research issues in data mining and knowledge discovery, pp 2\u201311","DOI":"10.1145\/882082.882086"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Lin J, Keogh E, Lonardi S, et al. (2004) Visually mining and monitoring massive time series. In: Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining, pp 460\u2013469","DOI":"10.1145\/1014052.1014104"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Ma J, Perkins S (2003) Online novelty detection on temporal sequences. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, pp 613\u2013618","DOI":"10.1145\/956750.956828"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Ratanamahatana C, Keogh E (2004) Making time-series classification more accurate using learned constraints. In: Proceedings of the 4th SIAM international conference on data mining, pp 11\u201322","DOI":"10.1137\/1.9781611972740.2"},{"key":"34_CR20","unstructured":"Ratanamahatana C, Keogh E (2005) Three myths about dynamic time warping. In: Proceedings of the 5th SIAM international conference on data mining, pp 506\u2013510"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Rombo S, Terracina G (2004) Discovering representative models in large time series databases. In: Proceedings of the 6th international conference on flexible query answering systems, pp 84\u201397","DOI":"10.1007\/978-3-540-25957-2_8"},{"key":"34_CR22","unstructured":"Ruzzo WL, Tompa M (1999) A linear time algorithm for finding all maximal scoring subsequences. In: Proceedings of the 7th international conference on intelligent systems for molecular biology, pp 234\u2013241"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Sadakane K (2000) Compressed text databases with efficient query algorithms based on the compressed suffix array. In: Proceedings of the 11th international conference on algorithms and computation (ISAAC 2000), pp 410\u2013421","DOI":"10.1007\/3-540-40996-3_35"},{"key":"34_CR24","unstructured":"Tanaka Y, Uehara K (2004) Motif discovery algorithm from motion data. In: Proceedings of the 18th annual conference of the Japanese society for artificial intelligence (JSAI)"},{"key":"34_CR25","first-page":"63","volume-title":"Human osteology","author":"TD White","year":"2000","unstructured":"White TD (2000) Human osteology, 2nd edn. Academic Press, San Diego, New York, pp 63\u201364","edition":"2nd edn."},{"key":"34_CR26","unstructured":"Yi BK, Faloutsos C (2000) Fast time sequence indexing for arbitrary Lp norms. In: Proceedings of the 26th international conference on very large data bases, pp 385\u2013394"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-006-0034-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-006-0034-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-006-0034-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:10:15Z","timestamp":1559110215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-006-0034-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,23]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,12,4]]}},"alternative-id":["34"],"URL":"https:\/\/doi.org\/10.1007\/s10115-006-0034-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,23]]}}}