The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Time Warp Edit Distance with Stiffness Adjustment for Time Series Matching
Open accessAbstract
In a way similar to the string-to-string correction problem, we address discrete time series similarity in light of a time-series-to-time-series-correction problem for which the similarity between two time series is measured as the minimum cost sequence of edit operations needed to transform one time series into another. To define the edit operations, we use the paradigm of a graphical editing process and end up with a dynamic programming algorithm that we call Time Warp Edit Distance (TWED). TWED is slightly different in form from Dynamic Time Warping (DTW), Longest Common Subsequence (LCSS), or Edit Distance with Real Penalty (ERP) algorithms. In particular, it highlights a parameter that controls a kind of stiffness of the elastic measure along the time axis. We show that the similarity provided by TWED is a potentially useful metric in time series retrieval applications since it could benefit from the triangular inequality property to speed up the retrieval process while tuning the parameters of the elastic measure. In that context, a lower bound is derived to link the matching of time series into downsampled representation spaces to the matching into the original space. The empiric quality of the TWED distance is evaluated on a simple classification task. Compared to Edit Distance, DTW, LCSS, and ERP, TWED has proved to be quite effective on the considered experimental task.
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
Binary Codes capable of currecting deletions, insertions, and reversals
Levenshtein, V. I. (1965) · Soviet physics. Doklady · Cited by 10,358
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
DOUGLAS, D. H., & PEUCKER, T. K. (1973) · Cartographica · doi:10.3138/fm57-6770-u75u-7727 · Cited by 4,229
Biological sequence analysis probabilistic models of proteins and nucleic acids
Durbin, R. M., Eddy, S. R., Krogh, A., & Mitchison, G. (1998) · Cited by 3,565
Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids
Durbin, R., Eddy, S. R., Krogh, A., & Mitchison, G. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511790492 · Cited by 3,246
The String-to-String Correction Problem
Wagner, R. A., & Fischer, M. J. (1974) · Journal of the ACM · doi:10.1145/321796.321811 · Cited by 3,032
An improved algorithm for matching biological sequences
Gotoh, O. (1982) · Journal of Molecular Biology · doi:10.1016/0022-2836(82)90398-9 · Cited by 1,724
Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases
Keogh, E., Chakrabarti, K., Pazzani, M., & Mehrotra, S. (2001) · Knowledge and Information Systems · doi:10.1007/pl00011669 · Cited by 1,573
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
Chávez, E., Navarro, G., Baeza-Yates, R., & Marroquín, J. L. (2001) · ACM Computing Surveys · doi:10.1145/502807.502808 · Cited by 1,246
A linear space algorithm for computing maximal common subsequences
Hirschberg, D. S. (1975) · Communications of the ACM · doi:10.1145/360825.360861 · Cited by 1,093
On The Marriage of Lp-norms and Edit Distance
Chen, L., & Ng, R. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50070-x · Cited by 774
Fast time series classification using numerosity reduction
Xi, X., Keogh, E., Shelton, C., Wei, L., & Ratanamahatana, C. A. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143974 · Cited by 591
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
A Dynamic Programming Approach to Continuous Speech Recognition
Sakoe, H., & Chiba, S. (1971) · Cited by 358
Deformable models in medical image analysis
McInerney, T., & Terzopoulos, D. (1996) · Proceedings of the Workshop on Mathematical Methods in Biomedical Image Analysis · doi:10.1109/mmbia.1996.534069 · Cited by 329
Keogh, E., & Pazzani, M. J. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45571-x_14 · Cited by 250
Automatic recognition of 200 words
Velichko, V. M., & Zagoruyko, N. G. (1970) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(70)80008-6 · Cited by 225
Optimum polygonal approximation of digitized curves
Perez, J.-C., & Vidal, E. (1994) · Pattern Recognition Letters · doi:10.1016/0167-8655(94)90002-7 · Cited by 218
Keogh, E., Li, W., Xi, X., Lee, S., & Vlachos, M. (2006) · doi:10.5555/1182635.1164203 · Cited by 197
Approximations to Magic: Finding Unusual Medical Time Series
Lin, J., Keogh, E., Fu, A. W.-C., & Herle, H. M.-L. V. (2005) · Proceedings - IEEE Symposium on Computer-Based Medical Systems · doi:10.1109/cbms.2005.34 · Cited by 140
Online event-driven subsequence matching over financial data streams
Wu, H., Salzberg, B. J., & Zhang, D. (2004) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1007568.1007574 · Cited by 126
A Survey of Computer-Based Deformable Models
Moore, P., & Molloy, D. (2007) · International Machine Vision and Image Processing Conference (IMVIP) · doi:10.1109/imvip.2007.31 · Cited by 81
Finding Motifs in a Database of Shapes
Xi, X., Keogh, E., Li, W., & Mafra‐Neto, A. (2007) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.23 · Cited by 51
INDEXING OF COMPRESSED TIME SERIES
Fink, E., & Pratt, K. (2004) · Series in machine perception and artificial intelligence · doi:10.1142/9789812565402_0003 · Cited by 46
Making Image Retrieval and Classification More Accurate Using Time Series and Learned Constraints
Ratanamahatana, C. A., Keogh, E., & Niennattrakul, V. (2009) · IGI Global eBooks · doi:10.4018/978-1-60566-174-2.ch007 · Cited by 25
Cited by
Inceptiontime: finding alexnet for time series classification
Ismail Fawaz, H., Lucas, B., Forestier, G., Pelletier, C., Schmidt, D. F., Weber, J., Webb, G. I., Idoumghar, L., Muller, P.-A., & Petitjean, F. (2020) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-020-00710-y · Cited by 1,788
Bagnall, A., Lines, J., Bostrom, A., Large, J., & Keogh, E. (2017) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-016-0483-9 · Cited by 1,377
Esling, P., & Agon, C. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379788 · Cited by 997
Time series classification with ensembles of elastic distance measures
Lines, J., & Bagnall, A. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0361-2 · Cited by 522
Time-Series Classification with COTE: The Collective of Transformation-Based Ensembles
Bagnall, A., Lines, J., Hills, J., & Bostrom, A. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2416723 · Cited by 416
Metadata
- Authors
- Marteau, P.-F.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2009-02
- Volume
- 31
- Issue
- 2
- Pages
- 306-318
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2143325592
- Cited by
- 335
- References
- 28
- FWCI
- 19.78
- Type
- journal article
- 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
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.