Finding the most unusual time series subsequence: algorithms and applications
The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Grossman, P. (2009) · Discrete Mathematics for Computing · doi:10.1007/978-0-230-37405-8_1 · Cited by 8,834
A symbolic representation of time series, with implications for streaming algorithms
Lin, J., Keogh, E., Lonardi, S., & Chiu, B. (2003) · Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery · doi:10.1145/882082.882086 · Cited by 1,799 · cited 8×
“The good news is that there is little freedom for the a parameter; extensive experiments carried out by the current authors [3, 11, 14, 16, 17] and dozens of other researchers worldwide [1, 12, 24, 21] suggest that a value of either 3 or 4 is best for virtually any task on any dataset.”
BackgroundMethodInfluentialSelf-citationPrimate adaptation and evolution
(1989) · Choice Reviews Online · doi:10.5860/choice.26-3889 · Cited by 1,246
Distance-based outliers: algorithms and applications
Knorr, E. M., Ng, R. T., & Tucakov, V. (2000) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s007780050006 · Cited by 1,195 · cited 2×
“We could simply project our time series into n-dimensional space and use existing outlier detection methods [2, 13].”
MethodFast Time Sequence Indexing for Arbitrary Lp Norms
Yi, B.-K., & Faloutsos, C. (2018) · doi:10.1184/r1/6605618 · Cited by 650
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 · cited 9×
“The good news is that there is little freedom for the a parameter; extensive experiments carried out by the current authors [3, 11, 14, 16, 17] and dozens of other researchers worldwide [1, 12, 24, 21] suggest that a value of either 3 or 4 is best for virtually any task on any dataset.”
BackgroundMethodInfluentialSelf-citationTowards parameter-free data mining
Keogh, E., Lonardi, S., & Ratanamahatana, C. A. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014077 · Cited by 567 · cited 10×
“For data mining purposes, we are often not interested in any of the global properties of a time series [6, 11, 24]; rather, we are interested in local subsections of the time series, which are called subsequences.”
BackgroundMethodInfluentialSelf-citationPrimate Adaptation and Evolution
Dunbar, R., & Fleagle, J. G. (1999) · The Journal of the Royal Anthropological Institute · doi:10.2307/2661176 · Cited by 518
On the need for time series data mining benchmarks: a survey and empirical demonstration
Keogh, E., & Kasetty, S. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775062 · Cited by 442
Self-citationMaking Time-series Classification More Accurate Using Learned Constraints
Ratanamahatana, C. A., & Keogh, E. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.2 · Cited by 407 · cited 2×
“Note that this requirement precludes the possibility of using R-trees, K-d trees or other classic indexing algorithms [10, 19].”
BackgroundMethodSelf-citationThree Myths about Dynamic Time Warping Data Mining
Ratanamahatana, C. A., & Keogh, E. (2005) · Proceedings of the 2005 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.50 · Cited by 393
Self-citationDistinguishing string selection problems
Lanctot, J. K., Li, M., Ma, B., Wang, S., & Zhang, L. (2003) · Information and Computation · doi:10.1016/s0890-5401(03)00057-9 · Cited by 302 · cited 1×
“Note that the superficially similar sounding Furthest (Sub)String Problem requires us to build a string, not to find one in the data [15].”
BackgroundOnline novelty detection on temporal sequences
Ma, J., & Perkins, S. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956828 · Cited by 225 · cited 1×
“Firstly, it is very difficult to make meaningful comparisons between our method, which requires only one intuitive parameter, and some of the rival methods that require three to seven parameters (see [11] for a detailed discussion of this), including some parameters for which we may have poor intuition, such as Embedd…”
Time-series Bitmaps: a Practical Visualization Tool for Working with Large Time Series Databases
Kumar, N., Lolla, V. N., Keogh, E., Lonardi, S., Ratanamahatana, C. A., & Wei, L. (2005) · Proceedings of the 2005 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.55 · Cited by 164 · cited 2×
“It has been used to find time series motifs [3, 21], to mine rules in health data [1], for anomaly detection [11], to extract features from a hepatitis database [12], for visualization [14, 17], and a host of other data mining tasks.”
BackgroundMethodSelf-citationVisually mining and monitoring massive time series
Lin, J., Keogh, E., Lonardi, S., Lankford, J. P., & Nystrom, D. M. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014104 · Cited by 162 · cited 3×
“It has been used to find time series motifs [3, 21], to mine rules in health data [1], for anomaly detection [11], to extract features from a hepatitis database [12], for visualization [14, 17], and a host of other data mining tasks.”
BackgroundMethodSelf-citationA linear time algorithm for finding all maximal scoring subsequences.
Ruzzo, W. L., & Tompa, M. (1999) · PubMed · Cited by 137
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array
Sadakane, K. (2000) · Lecture notes in computer science · doi:10.1007/3-540-40996-3_35 · Cited by 124 · cited 1×
“Surprisingly, both data structures can be created in time and space linear in the length of T [1, 23].”
BackgroundFinding recurrent sources in sequences
Gionis, A., & Mannila, H. (2003) · Research in Computational Molecular Biology · doi:10.1145/640075.640091 · Cited by 74 · cited 1×
“Most real-valued time series problems such as motif discovery [1, 3, 12], longest common subsequence matching, sequence averaging, segmentation [8], indexing [10], etc.”
BackgroundOn Complementarity of Cluster and Outlier Detection Schemes
Chen, Z., Fu, A. W.-C., & Tang, J. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45228-7_24 · Cited by 20
Duchêne, F., Garbay, C., & Rialle, V. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0412003 · Cited by 10 · cited 1×
“For data mining purposes, we are often not interested in any of the global properties of a time series [6, 11, 24]; rather, we are interested in local subsections of the time series, which are called subsequences.”
Background
Cited by
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
“The data in this domain typically has a temporal aspect and time-series analysis is also used in some techniques [Keogh et al. 2002, 2006; Basu and Meckesheimer 2007].”
MethodPimentel, M. A. F., Clifton, D. A., Clifton, L., & Tarassenko, L. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.12.026 · Cited by 1,649
A review on time series data mining
Fu, T.-C. (2011) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2010.09.007 · Cited by 1,500
A Review on Outlier/Anomaly Detection in Time Series Data
Blázquez-García, A., Conde, A., Mori, U., & Lozano, J. A. (2022) · ACM Computing Surveys · doi:10.1145/3444690 · Cited by 1,102
Outlier Detection for Temporal Data: A Survey
Gupta, M., Gao, J., Aggarwal, C. C., & Han, J. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.184 · Cited by 1,001
Metadata
- Authors
- Keogh, E., Lin, J., Lee, S.-H., & Herle, H. V.
- Venue
- Knowledge and Information Systems
- Published
- 2006-11-23
- Volume
- 11
- Issue
- 1
- Pages
- 1-27
- ISSN
- 0219-1377 (ISSN-L)
- 0219-3116
- OpenAlex
- W2113049098
- Cited by
- 228
- References
- 22
- FWCI
- 9.46
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.