The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Scaling up dynamic time warping for datamining applications
Open accessAbstract
There has been much recent interest in adapting data mining algorithms to time series databases.Most of these algorithms need to compare time series.Typically some variation of Euclidean distance is used.However, as we demonstrate in this paper, Euclidean distance can be an extremely brittle distance measure.Dynamic time warping (DTW) has been suggested as a technique to allow more robust distance calculations, however it is computationally expensive.In this paper we introduce a modification of DTW which operates on a higher level abstraction of the data, in particular, a Piecewise Aggregate Approximation (PAA).Our approach allows us to outperform DTW by one to two orders of magnitude, with no loss of accuracy.
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
Fundamentals of speech recognition
Rabiner, L. R., & Juang, B.-H. F. (1993) · Cited by 7,680
Dynamic Programming Algorithm Optimization for Spoken Word Recognition
Sakoe, H., & Chiba, S. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163055 · Cited by 6,727
(1994) · Knowledge Discovery and Data Mining · Cited by 3,137
Fast subsequence matching in time-series databases
Faloutsos, C., Ranganathan, M., & Manolopoulos, Y. (1994) · Proceedings of the 1994 ACM SIGMOD international conference on Management of data · doi:10.1145/191839.191925 · Cited by 1,709
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
Agrawal, R., Lin, K.-I., Sawhney, H., & Shim, K. (1995) · Cited by 649
Rule discovery from time series
Das, G., Lin, K.-I., Mannila, H., Renganathan, G., & Smyth, P. (1998) · Cited by 637
Keogh, E., & Pazzani, M. J. (1998) · Cited by 496
Self-citationApproximate queries and representations for large data sequences
Shatkay, H., & Zdonik, S. B. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1996.492204 · Cited by 263
A probabilistic approach to fast pattern matching in time series databases
Keogh, E., & Smyth, P. (1997) · Knowledge Discovery and Data Mining · Cited by 254
Self-citationKeogh, E., & Pazzani, M. J. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45571-x_14 · Cited by 250
Self-citation
Cited by
Exact indexing of dynamic time warping
Keogh, E., & Ratanamahatana, C. A. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-004-0154-9 · Cited by 1,962
Self-citationToward accurate dynamic time warping in linear time and space
Salvador, S., & Chan, P. (2007) · Intelligent Data Analysis · doi:10.3233/ida-2007-11508 · Cited by 1,705
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
Discovering similar multidimensional trajectories
Vlachos, M., Kollios, G., & Gunopulos, D. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994784 · Cited by 1,468
Robust and fast similarity search for moving object trajectories
Chen, L., Özsu, M. T., & Oria, V. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066213 · Cited by 1,336
Derivative Dynamic Time Warping
Keogh, E. J., & Pazzani, M. J. (2001) · Proceedings of the 2001 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972719.1 · Cited by 1,143
Self-citationIntelligent multi-camera video surveillance: A review
Wang, X. (2013) · Pattern Recognition Letters · doi:10.1016/j.patrec.2012.07.005 · Cited by 694
A brief survey on sequence classification
Xing, Z., Pei, J., & Keogh, E. (2010) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1882471.1882478 · Cited by 553
Self-citationImaging Time-Series to Improve Classification and Imputation
Wang, Z., & Oates, T. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.00327 · Cited by 470
Making 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
Self-citationHierarchical Aligned Cluster Analysis for Temporal Clustering of Human Motion
Zhou, F., De la Torre, F., & Hodgins, J. K. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.137 · Cited by 337
A survey of temporal data mining
Laxman, S., & Sastry, P. S. (2006) · Sadhana · doi:10.1007/bf02719780 · Cited by 314
Pattern Extraction for Time Series Classification
Geurts, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44794-6_10 · Cited by 292
Iterative Deepening Dynamic Time Warping for Time Series
Chu, S., Keogh, E., Hart, D., & Pazzani, M. (2002) · Proceedings of the 2002 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972726.12 · Cited by 268
Self-citationHaar wavelets for efficient similarity search of time-series: with and without time warping
Chan, F. K., Fu, A. W.-C., & Yu, C. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1198399 · Cited by 261
Yang, Q., Zhang, Y., Dai, W., & Pan, S. J. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139061773 · Cited by 254
An artificial intelligence life cycle: from conception to production
De Silva, D., & Alahakoon, D. (2022) · Patterns · doi:10.1016/j.patter.2022.100489 · Cited by 189
DeepMood: Modeling Mobile Phone Typing Dynamics for Mood Detection
Cao, B., Zheng, L., Zhang, C., Yu, P. S., Piscitello, A., Zulueta, J., Ajilore, O., Ryan, K., & Leow, A. D. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098086 · Cited by 145
“Distance based methods include K nearest neighbor classifier [16, 26, 27, 38, 47, 49] and SVMwith local alignment kernel [32, 41, 42] by measuring the similarity between a pair of sequences.”
MethodGeneral Evaluation for Instruction Conditioned Navigation using Dynamic Time Warping
Ilharco, G., Jain, V., Ku, A., Ie, E., & Baldridge, J. (2019) · arXiv · doi:10.48550/arxiv.1907.05446
Metadata
- Authors
- Keogh, E. J., & Pazzani, M. J.
- Venue
- Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2000-08
- Pages
- 285-289
- OpenAlex
- W1966554111
- Cited by
- 820
- References
- 14
- FWCI
- 9.68
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.