Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 845

The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.

Experimental comparison of representation methods and distance measures for time series data

Open access
Wang, Xiaoyue, Mueen, Abdullah, Ding, Hui, Trajcevski, Goce, Scheuermann, Peter, Keogh, Eamonn·2013·Data Mining and Knowledge Discovery

Abstract

The previous decade has brought a remarkable increase of the interest in applications that deal with querying and mining of time series data. Many of the research efforts in this context have focused on introducing new representation methods for dimensionality reduction or novel similarity measures for the underlying data. In the vast majority of cases, each individual work introducing a particular method has made specific claims and, aside from the occasional theoretical justifications, provided quantitative experimental observations. However, for the most part, the comparative aspects of these experiments were too narrowly focused on demonstrating the benefits of the proposed methods over some of the previously introduced ones. In order to provide a comprehensive validation, we conducted an extensive experimental study re-implementing eight different time series representations and nine similarity measures and their variants, and testing their effectiveness on 38 time series data sets from a wide variety of application domains. In this article, we give an overview of these different techniques and present our comparative experimental findings regarding their effectiveness. In addition to providing a unified validation of some of the existing achievements, our experiments also indicate that, in some cases, certain claims in the literature may be unduly optimistic.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s10618-012-0250-5

Cites

50 of 50 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 50 references

Research works printed but not linked: 16

  1. Aßfalg J, Kriegel H-P, Kroger P, Kunath P, Pryakhin A, Renz M (2008) Similarity search in multimedia time series data using amplitude-level features. In: MMM’08, pp 123–133 · doi:10.1007/978-3-540-77409-9_12
  2. Assent I, Wichterich M, Krieger R, Kremer H, Seidl T (2009) Anticipatory dtw for efficient similarity search in time series databases. PVLDB 2(1): 826–837
  3. Cardle M (2004) Automated motion EDITInG. In: Technical report, Computer Laboratory, University of Cambridge, Cambridge
  4. Flato E (2000) Robust and efficient computation of planar minkowski sums. Master’s thesis, School of Exact Sciences, Tel-Aviv University
  5. Karamitopoulos L, Evangelidis G (2009) A dispersion-based paa representation for time series. In: CSIE (4), pp 490–494 · doi:10.1109/csie.2009.622
  6. Kim S-W, Park S, Chu WW (2001) An index-based approach for similarity search supporting time warping in large sequence databases. In: ICDE
  7. Lin Y (2006) Efficient human motion retrieval in large databases. In: GRAPHITE, pp 31–37 · doi:10.1145/1174429.1174434
  8. Olofsson P (2005) Probability, statistics and stochastic processes. Wiley-Interscience, Hoboken · doi:10.1002/9780471743064
  9. Papadopoulos AN (2008) Trajectory retrieval with latent semantic analysis. In: SAC’08, pp 1089–1094 · doi:10.1145/1363686.1363941
  10. Park S, Kim S-W (2006) Prefix-querying with an 11 distance metric for time-series subsequence matching under time warping · doi:10.1177/0165551506064401
  11. Sakurai Y, Yoshikawa M, Faloutsos C (2005) Ftw: fast similarity search under the time warping distance. In: PODS’05, pp 326–337 · doi:10.1145/1065167.1065210
  12. Workshop and challenge on time series classification at SIGKDD (2007). http://www.cs.ucr.edu/~eamonn/SIGKDD2007TimeSeries.html
  13. Yi B-K, Jagadish HV, Faloutsos C (1998) Efficient retrieval of similar time sequences under time warping. In: ICDE. IEEE Computer Society
  14. Zhang G HB, Kinsner W (2009) Electrocardiogram data mining based on frame classification by dynamic time warping matching. Comput Methods Biomech Biomed Eng · doi:10.1080/10255840902882158
  15. Zhou M, Wong MH (2007) Boundary-based lower-bound functions for dynamic time warping and their indexing. In: ICDE’07, pp 1307–1311 · doi:10.1109/icde.2007.368999
  16. Zhu Y, Shasha D (2003) Warping indexes with envelope transforms for query by humming. In: SIGMOD conference · doi:10.1145/872773.872780

Cited by

See all 845

Metadata

Authors
Wang, X., Mueen, A., Ding, H., Trajcevski, G., Scheuermann, P., & Keogh, E.
Venue
Data Mining and Knowledge Discovery
Published
2012-02-10
Volume
26
Issue
2
Pages
275-309
ISSN
  • 1384-5810 (ISSN-L)
  • 1573-756X
OpenAlex
W2029767187
Cited by
845
References
50
FWCI
52.93
Type
journal article
Language
en
Open access
green
Licence
www.springer.com/tdm (tdm)

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: Experimental comparison of representation methods and distance measures for time series data. https://app.cochat.ai/papers/10.1007/s10618-012-0250-5
The paper
Wang, X., Mueen, A., Ding, H., Trajcevski, G., Scheuermann, P., & Keogh, E. (2013). Experimental comparison of representation methods and distance measures for time series data. Data Mining and Knowledge Discovery. https://doi.org/10.1007/s10618-012-0250-5

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.