The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Exact Discovery of Time Series Motifs
Open accessAbstract
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computational biology, this similarity hints at structure which has been conserved for some reason and may therefore be of interest. Since the formalism of time series motifs in 2002, dozens of researchers have used them for diverse applications in many different domains. Because the obvious algorithm for computing motifs is quadratic in the number of items, more than a dozen approximate algorithms to discover motifs have been proposed in the literature. In this work, for the first time, we show a tractable exact algorithm to find time series motifs. As we shall show through extensive experiments, our algorithm is up to three orders of magnitude faster than brute-force search in large datasets. We further show that our algorithm is fast enough to be used as a subroutine in higher level data mining algorithms for anytime classification, near-duplicate detection and summarization, and we consider detailed case studies in domains as diverse as electroencephalograph interpretation and entomological telemetry data mining.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
80 Million Tiny Images: A Large Data Set for Nonparametric Object and Scene Recognition
Torralba, A., Fergus, R., & Freeman, W. T. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.128 · Cited by 1,921
Ding, H., Trajcevski, G., Scheuermann, P., Wang, X., & Keogh, E. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454226 · Cited by 1,354
Self-citationReduction Techniques for Instance-Based Learning Algorithms
Wilson, D. R., & Martinez, T. R. (2000) · Machine Learning · doi:10.1023/a:1007626913721 · Cited by 1,182
Efficient color histogram indexing for quadratic form distance functions
Hafner, J., Sawhney, H. S., Equitz, W., Flickner, M., & Niblack, W. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.391417 · Cited by 833
Probabilistic discovery of time series motifs
Chiu, B., Keogh, E., & Lonardi, S. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956808 · Cited by 573
Self-citationLin, J. (2002) · Cited by 460
Loomis, A. L., Harvey, E. N., & Hobart, G. A. (1938) · Journal of Neurophysiology · doi:10.1152/jn.1938.1.5.413 · Cited by 335
Discovery of Time-Series Motif from Multi-Dimensional Data Based on MDL Principle
Tanaka, Y., Iwamoto, K., & Uehara, K. (2005) · Machine Learning · doi:10.1007/s10994-005-5829-2 · Cited by 229
Keogh, E., Li, W., Xi, X., Lee, S., & Vlachos, M. (2006) · doi:10.5555/1182635.1164203 · Cited by 197
Self-citation
Cited by
Yeh, C.-C. M., Zhu, Y., Ulanova, L., Begum, N., Ding, Y., Dau, H. A., Silva, D. F., Mueen, A., & Keogh, E. (2016) · 2016 IEEE 16th International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2016.0179 · Cited by 653
Self-citationA shapelet transform for time series classification
Lines, J., Davis, L. M., Hills, J., & Bagnall, A. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339579 · Cited by 368
The Virtual Brain Integrates Computational Modeling and Multimodal Neuroimaging
Ritter, P., Schirner, M., McIntosh, A. R., & Jirsa, V. K. (2013) · Brain Connectivity · doi:10.1089/brain.2012.0120 · Cited by 268
Metadata
- Authors
- Mueen, A., Keogh, E., Zhu, Q., Cash, S., & Westover, B.
- Venue
- Proceedings of the 2009 SIAM International Conference on Data Mining
- Published
- 2009-04-30
- Volume
- 2009
- Pages
- 473-484
- OpenAlex
- W1513731586
- Cited by
- 423
- References
- 21
- FWCI
- 28.16
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Exact Discovery of Time Series Motifs. https://app.cochat.ai/papers/10.1137/1.9781611972795.41
- The paper
- Mueen, A., Keogh, E., Zhu, Q., Cash, S., & Westover, B. (2009). Exact Discovery of Time Series Motifs. Proceedings of the 2009 SIAM International Conference on Data Mining. https://doi.org/10.1137/1.9781611972795.41
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.