{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:33:48Z","timestamp":1784874828993,"version":"3.55.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,4,12]],"date-time":"2013-04-12T00:00:00Z","timestamp":1365724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s10618-013-0312-3","type":"journal-article","created":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T11:48:30Z","timestamp":1365680910000},"page":"634-669","source":"Crossref","is-referenced-by-count":303,"title":["CID: an efficient complexity-invariant distance for time series"],"prefix":"10.1007","volume":"28","author":[{"given":"Gustavo E. A. P. A.","family":"Batista","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eamonn J.","family":"Keogh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oben Moses","family":"Tataw","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vin\u00edcius M. A.","family":"de Souza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,4,12]]},"reference":[{"issue":"1","key":"312_CR1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1002\/1097-0193(200009)11:1<46::AID-HBM40>3.0.CO;2-5","volume":"11","author":"SG Andino","year":"2000","unstructured":"Andino SG, de Peralta Menendez RG (2000) Measuring the complexity of time series: an application to neurophysiological signals. Hum Brain Mapp 11(1):46\u201357","journal-title":"Hum Brain Mapp"},{"key":"312_CR2","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/s00421-006-0226-5","volume":"98","author":"W Aziz","year":"2006","unstructured":"Aziz W, Arif M (2006) Complexity analysis of stride interval time series by threshold dependent symbolic entropy. Eur J Appl Physiol 98:30\u201340. doi: 10.1007\/s00421-006-0226-5","journal-title":"Eur J Appl Physiol"},{"key":"312_CR3","doi-asserted-by":"crossref","unstructured":"Bandt C, Pompe B (2002) Permutation entropy: a natural complexity measure for time series. Phys Rev Lett 88(17). doi: 10.1103\/PhysRevLett.88.174102","DOI":"10.1103\/PhysRevLett.88.174102"},{"key":"312_CR4","unstructured":"Batista G (2011) Website for this paper. http:\/\/www.icmc.usp.br\/~gbatista\/cid (Online)"},{"key":"312_CR5","doi-asserted-by":"crossref","unstructured":"Batista G, Wang X, Keogh EJ (2011) A complexity-invariant distance measure for time series. In: Proceedings of the 2011 SIAM International Conference on Data Mining (SDM), pp 699\u2013710. http:\/\/www.siam.omnibooksonline.com\/2011datamining\/data\/papers\/106.pdf","DOI":"10.1137\/1.9781611972818.60"},{"key":"312_CR6","unstructured":"Chandola V, Cheboli D, Kumar V (2009) Detecting anomalies in a time series database. CS Technical Report 09\u2013004, Computer Science Department, University of Minnesota"},{"key":"312_CR7","doi-asserted-by":"crossref","unstructured":"Ch\u00e1vez E, Navarro G, Baeza-Yates R, Marroqu\u00edn JL (2001) Searching in metric spaces. ACM Comput Surv 33:273\u2013321. doi 10.1145\/502807.502808","DOI":"10.1145\/502807.502808"},{"key":"312_CR8","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"key":"312_CR9","doi-asserted-by":"crossref","unstructured":"Ding H, Trajcevski G, Wang X, Keogh E (2008) Querying and mining of time series data: experimental comparison of representations and distance measures. In: International Conference on Very Large Data Bases, pp 1542\u20131552","DOI":"10.14778\/1454159.1454226"},{"key":"312_CR10","unstructured":"Elkan C (2003) Using the triangle inequality to accelerate k-means. In: International Conference on Machine Learning, pp 147\u2013153"},{"key":"312_CR11","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/191843.191925","volume":"23","author":"C Faloutsos","year":"1994","unstructured":"Faloutsos C, Ranganathan M, Manolopoulos Y (1994) Fast subsequence matching in time-series databases. SIGMOD Rec 23:419\u2013429. doi: 10.1145\/191843.191925","journal-title":"SIGMOD Rec"},{"issue":"23","key":"312_CR12","doi-asserted-by":"crossref","first-page":"e215","DOI":"10.1161\/01.CIR.101.23.e215","volume":"101","author":"AL Goldberger","year":"2000","unstructured":"Goldberger AL, Amaral LAN, Glass L, Hausdorff JM, Ivanov PC, Mark RG, Mietus JE, Moody GB, Peng CK, Stanley HE (2000) PhysioBank, PhysioToolkit, and PhysioNet: components of a new research resource for complex physiologic signals. Circulation 101(23):e215\u2013e220","journal-title":"Circulation"},{"key":"312_CR13","doi-asserted-by":"crossref","unstructured":"Hearn DJ (2009) Shape analysis for the automated identification of plants from images of leaves. Taxon 58:934\u2013954(21). http:\/\/www.ingentaconnect.com\/content\/iapt\/tax\/2009\/00000058\/00000003\/art00021","DOI":"10.1002\/tax.583021"},{"key":"312_CR14","doi-asserted-by":"crossref","unstructured":"Hjaltason GR, Samet H (2003) Index-driven similarity search in metric spaces (survey article). ACM Trans Database Syst 28:517\u2013580. doi: 10.1145\/958942.958948","DOI":"10.1145\/958942.958948"},{"key":"312_CR15","doi-asserted-by":"crossref","unstructured":"Hu B, Rakthanmanon T, Hao Y, Evans S, Lonardi S, Keogh E (2011) Discovering the intrinsic cardinality and dimensionality of time series using MDL. In: IEEE International Conference on Data Mining(ICDM), pp 1086\u20131091","DOI":"10.1109\/ICDM.2011.54"},{"key":"312_CR16","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"2005","unstructured":"Kaufman L, Rousseeuw PJ (2005) Finding groups in data: an introduction to cluster analysis. Wiley, New York"},{"key":"312_CR17","doi-asserted-by":"crossref","unstructured":"Keogh E (2002) Exact indexing of dynamic time warping. In: International Conference on Very Large Data Bases, pp 406\u2013417. http:\/\/portal.acm.org\/citation.cfm?id=1287369.1287405","DOI":"10.1016\/B978-155860869-6\/50043-3"},{"key":"312_CR18","doi-asserted-by":"crossref","unstructured":"Keogh E (2003) Efficiently finding arbitrarily scaled patterns in massive time series databases. In: Knowledge Discovery in Databases: PKDD 2003, vol 2838, pp 253\u2013265. doi: 10.1007\/978-3-540-39804-2_24","DOI":"10.1007\/978-3-540-39804-2_24"},{"key":"312_CR19","unstructured":"Keogh EJ, Xi X, Wei L, Ratanamahatana C (2006) The UCR time series classification\/clustering homepage. http:\/\/www.cs.ucr.edu\/~eamonn\/time_series_data\/ (Online)"},{"key":"312_CR20","doi-asserted-by":"crossref","unstructured":"Keogh E, Lonardi S, Ratanamahatana CA, Wei L, Lee SH, Handley J (2007) Compression-based data mining of sequential data. Data Min Knowl Discov 14:99\u2013129. http:\/\/portal.acm.org\/citation.cfm?id=1231311.1231321","DOI":"10.1007\/s10618-006-0049-3"},{"key":"312_CR21","doi-asserted-by":"crossref","unstructured":"Keogh E, Wei L, Xi X, Vlachos M, Lee SH, Protopapas P (2009) Supporting exact indexing of arbitrarily rotated shapes and periodic time series under euclidean and warping distance measures. VLDB J 18:611\u2013630. doi: 10.1007\/s00778-008-0111-4","DOI":"10.1007\/s00778-008-0111-4"},{"key":"312_CR22","doi-asserted-by":"crossref","unstructured":"Li M, Vitnyi PM (2008) An introduction to Kolmogorov complexity and its applications, 3rd edn. Springer Publishing Company, Incorporated, Heidelberg","DOI":"10.1007\/978-0-387-49820-1"},{"key":"312_CR23","first-page":"141","volume":"12","author":"K Li","year":"2002","unstructured":"Li K, Yan M, Yuan S (2002) A simple statistical model for depicting the cdc15-synchronized yeast cell-cycle regulated gene expression data. Stat Sin 12:141\u2013158","journal-title":"Stat Sin"},{"key":"312_CR24","doi-asserted-by":"crossref","unstructured":"Lin J, Keogh E, Lonardi S, Chiu B (2003) A symbolic representation of time series, with implications for streaming algorithms. In: 8th ACM SIGMOD Workshop on Research Issues in, Data Mining and Knowledge Discovery, pp 2\u201311","DOI":"10.1145\/882082.882086"},{"key":"312_CR25","unstructured":"Moore A (2000) The anchors hierarchy: using the triangle inequality to survive high-dimensional data. In: Conference on Uncertainty in Artificial Intelligence, pp 397\u2013405"},{"key":"312_CR26","doi-asserted-by":"crossref","unstructured":"Mueen A, Keogh E, Bigdely-Shamlo N (2009) Finding time series motifs in disk-resident data. In: IEEE International Conference on Data Mining, pp 367\u2013376. doi: 10.1109\/ICDM.2009.15","DOI":"10.1109\/ICDM.2009.15"},{"key":"312_CR27","unstructured":"Ng AY, Jordan MI, Weiss Y (2001) On spectral clustering: analysis and an algorithm. In: Dietterich TG, Becker S, Ghahramani Z (eds) Advances in neural information processing systems, MIT Press, Cambridge, pp 849\u2013856"},{"key":"312_CR28","doi-asserted-by":"crossref","unstructured":"Orchard M (1991) A fast nearest-neighbor search algorithm. In: Acoustics, Speech, and Signal Processing, 1991. ICASSP-91, 1991 International Conference on, vol 4, pp 2297\u20132300. doi: 10.1109\/ICASSP.1991.150755","DOI":"10.1109\/ICASSP.1991.150755"},{"issue":"2","key":"312_CR29","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1111\/j.1365-2966.2006.10327.x","volume":"369","author":"P Protopapas","year":"2006","unstructured":"Protopapas P, Giammarco JM, Faccioli L, Struble MF, Dave R, Alcock C (2006) Finding outlier light curves in catalogues of periodic variable stars. Mon Notices R Astron Soc 369(2):677\u2013696","journal-title":"Mon Notices R Astron Soc"},{"key":"312_CR30","volume-title":"Digital Processing of Speech Signals","author":"L Rabiner","year":"1978","unstructured":"Rabiner L, Schafer R (1978) Digital Processing of Speech Signals. Prentice Hall, Englewood Cliffs"},{"key":"312_CR31","doi-asserted-by":"crossref","unstructured":"Rakthanmanon T, Campana B, Mueen A, Batista G, Westover B, Zhu Q, Zakaria J, Keogh E (2012) Searching and mining trillions of time series subsequences under dynamic time warping. In: ACM KDD, pp 262\u2013270","DOI":"10.1145\/2339530.2339576"},{"issue":"336","key":"312_CR32","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand WM (1971) Objective criteria for the evaluation of clustering methods. J Am Stat Assoc 66(336):846\u2013850","journal-title":"J Am Stat Assoc"},{"issue":"9","key":"312_CR33","doi-asserted-by":"crossref","first-page":"1186","DOI":"10.1109\/10.709563","volume":"44","author":"I Rezek","year":"1998","unstructured":"Rezek I (1998) Stochastic complexity measures for physiological signal analysis. IEEE Trans Biomed Eng 44(9):1186\u20131191","journal-title":"IEEE Trans Biomed Eng"},{"key":"312_CR34","volume-title":"Fractals Chaos, Power Laws: minutes from an infinite paradise","author":"M Schroeder","year":"2009","unstructured":"Schroeder M (2009) Fractals Chaos, Power Laws: minutes from an infinite paradise. Dover Publications, New York"},{"key":"312_CR35","doi-asserted-by":"crossref","unstructured":"Vlachos M, Hadjieleftheriou M, Gunopulos D, Keogh EJ (2003) Indexing multi-dimensional time-series with support for multiple distance measures. In: ACM KDD, pp 216\u2013225","DOI":"10.1145\/956750.956777"},{"key":"312_CR36","doi-asserted-by":"crossref","unstructured":"Yankov D, Keogh E, Rebbapragada U (2008) Disk aware discord discovery: finding unusual time series in terabyte sized datasets. Knowl Info Syst 17:241\u2013262. doi: 10.1007\/s10115-008-0131-9","DOI":"10.1007\/s10115-008-0131-9"},{"key":"312_CR37","doi-asserted-by":"crossref","unstructured":"Ye L, Wang X, Keogh EJ, Mafra-Neto A (2009) Autocannibalistic and anyspace indexing algorithms with application to sensor data mining. In: SIAM International Conference on Data Mining, pp 85\u201396. http:\/\/www.siam.org\/proceedings\/datamining\/2009\/dm09_009_yel.pdf","DOI":"10.1137\/1.9781611972795.8"},{"key":"312_CR38","doi-asserted-by":"crossref","unstructured":"\u017dunic J, Rosin P, Kopanja L (2006) Shape orientability. In: Computer Vision ACCV 2006, pp 11\u201320. doi: 10.1007\/11612704_2","DOI":"10.1007\/11612704_2"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0312-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-013-0312-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0312-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T12:22:43Z","timestamp":1562934163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-013-0312-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,12]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["312"],"URL":"https:\/\/doi.org\/10.1007\/s10618-013-0312-3","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,12]]}}}