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 accessAbstract
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.
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
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection
Kohavi, R. (1995) · Zenodo · doi:10.5281/zenodo.19712698 · Cited by 10,909
(2008) · Data Mining and Market Intelligence for Optimal Marketing Returns · doi:10.4324/9780080878096-12 · Cited by 6,954
An Introduction to Data Mining
Stephens, C. R., & Sukumar, R. (2006) · The Handbook of Marketing Research · doi:10.4135/9781412973380.n22 · Cited by 4,562
Data Mining: Concepts and Techniques
Thamaraiselvi, G., & Kaliammal, A. (2014) · Journal of Information and Knowledge · Cited by 4,088
Pattern Classification and Scene Analysis.
Clarke, M. R. B., Duda, R. O., & Hart, P. E. (1974) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344977 · Cited by 3,222
(1994) · Knowledge Discovery and Data Mining · Cited by 3,137
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-citationFast 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
Research works printed but not linked: 16
- 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
- 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
- Cardle M (2004) Automated motion EDITInG. In: Technical report, Computer Laboratory, University of Cambridge, Cambridge
- Flato E (2000) Robust and efficient computation of planar minkowski sums. Master’s thesis, School of Exact Sciences, Tel-Aviv University
- 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
- Kim S-W, Park S, Chu WW (2001) An index-based approach for similarity search supporting time warping in large sequence databases. In: ICDE
- Lin Y (2006) Efficient human motion retrieval in large databases. In: GRAPHITE, pp 31–37 · doi:10.1145/1174429.1174434
- Olofsson P (2005) Probability, statistics and stochastic processes. Wiley-Interscience, Hoboken · doi:10.1002/9780471743064
- Papadopoulos AN (2008) Trajectory retrieval with latent semantic analysis. In: SAC’08, pp 1089–1094 · doi:10.1145/1363686.1363941
- 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
- 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
- Workshop and challenge on time series classification at SIGKDD (2007). http://www.cs.ucr.edu/~eamonn/SIGKDD2007TimeSeries.html
- Yi B-K, Jagadish HV, Faloutsos C (1998) Efficient retrieval of similar time sequences under time warping. In: ICDE. IEEE Computer Society
- 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
- 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
- Zhu Y, Shasha D (2003) Warping indexes with envelope transforms for query by humming. In: SIGMOD conference · doi:10.1145/872773.872780
Cited by
Time-series clustering – A decade review
Aghabozorgi, S., Seyed Shirkhorshidi, A., & Ying Wah, T. (2015) · Information Systems · doi:10.1016/j.is.2015.04.007 · Cited by 1,826
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
Self-citationFast Shapelets: A Scalable Algorithm for Discovering Time Series Shapelets
Rakthanmanon, T., & Keogh, E. (2013) · Proceedings of the 2013 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972832.74 · Cited by 388
Self-citationMulti-channel based Sybil attack detection in vehicular ad hoc networks using RSSI
Yao, Y., Xiao, B., Wu, G., Liu, X., Yu, Z., Zhang, K., & Zhou, X. (2019) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2018.2833849 · Cited by 118
Physical Activity Recognition from Accelerometer Data Using a Multi-Scale Ensemble Method
Zheng, Y., Won, W.-K., Guan, X., & Trost, S. (2013) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v27i2.18997 · Cited by 84
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.