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

The DOI matches its Crossref record.

Scaling and time warping in time series querying

Fu, Ada Wai-Chee, Keogh, Eamonn, Lau, Leo Yung Hang, Ratanamahatana, Chotirat Ann, Wong, Raymond Chi-Wing · 2008 · The VLDB Journal

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/s00778-006-0040-z

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.

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

No references could be resolved yet.

Research works printed but not linked: 36

  1. Agrawal, R., Lin, K.I., Sawhney, H.S., Shim, K.: Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In: VLDB’95, Proceedings of 21st International Conference on Very Large Data Bases, pp. 490–501. Morgan Kaufmann, Zurich (1995)
  2. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD ’90: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pp. 322–331. ACM Press, Atlantic City (1990) · DOI · Paper page
  3. Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-tree: An index structure for high-dimensional data. In: VLDB’96, Proceedings of 22nd International Conference on Very Large Data Bases, pp. 28–39. Morgan Kaufmann, Mumbai (Bombay) (1996)
  4. Campbell, L., Bobick, A.: Recognition of human body motion using phase space constraints. In: Proceedings of International Conference on Computer Vision, pp. 624–630. IEEE Computer Society, Washington (1995) · DOI · Paper page
  5. Chai, W., Vercoe, B.: Folk music classification using hidden markov models. In: Proceedings of International Conference on Articial Intelligence (2001)
  6. Chan, F., Fu, A.: Efficient time series matching by wavelets. In: Proceedings of the 15th International Conference on Data Engineering. IEEE Computer Society, Sydney (1999)
  7. Cheung K.L. and Fu A.W.C. (1998). Enhanced nearest neighbour search on the R-tree. ACM SIGMOD Reco. 27(3): 16–21 · doi:10.1145/290593.290596
  8. Dalal, N., Horaud, R.: Indexing key positions between multiple videos. In: Proceedings of IEEE Workshop on Motion and Video Computing, pp. 65–71. IEEE Computer Society, Orlando (2002) · doi:10.1109/motion.2002.1182215
  9. Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast subsequence matching in time-series databases. In: SIGMOD ’94: Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, pp. 419–429. ACM Press, Minneapolis (1994) · DOI · Paper page
  10. Fu A., Chan P., Cheung Y.L. and Moon Y. (2000). Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances. VLDB J. 9(2): 154–173 · doi:10.1007/pl00010672
  11. Fu, A.W.C., Keogh, E., Lau, Y.H., Ratanamahatana, C.A.: Scaling and time warping in time series querying. In: VLDB 2005, Proceedings of 31st International Conference on Very Large Data Bases. Morgan Kaufmann, Trondheim (2005) (in press)
  12. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD ’84: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, pp. 47–57. ACM Press, Boston (1984) · DOI · Paper page
  13. Hjaltason G.R. and Samet H. (1999). Distance browsing in spatial databases. ACM Trans. Database Syst. 24(2): 265–318 · doi:10.1145/320248.320255
  14. Itakura F. (1975). Minimum prediction residual principle applied to speech recognition. IEEE Trans. Acoust. Speech Signal Process. 23(1): 67–72 · DOI · Paper page
  15. Kale, A., Chowdhury, R., Chellappa, R.: Towards a view invariant gait recognition algorithm. In: Proceedings of the IEEE International Conference on Advanced Video and Signal based Surveillance (AVSS). IEEE Computer Society, Miami (2003) · DOI · Paper page
  16. Kale, A., Cuntoor, N., Yegnanarayana, B., Rajagopalan, A., Chellappa, R.: Gait analysis for human identification. In: Proceedings of the 3rd International conference on Audio and Video Based Person Authentication (2003) · DOI · Paper page
  17. Keogh, E.: Exact indexing of dynamic time warping. In: VLDB 2002, Proceedings of 28th International Conference on Very Large Data Bases, pp. 406–417. Morgan Kaufmann, Hong Kong (2002) · DOI · Paper page
  18. Keogh E., Chakrabarti K., Pazzani M. and Mehrotra S. (2001). Dimensionality reduction for fast similarity search in large time series databases. Knowl. Inf. Syst. 3(3): 263–286 · DOI · Paper page
  19. Keogh, E., Palpanas, T., Zordan, V.B., Gunopulos, D., Cardle, M.: Indexing large human-motion databases. In: VLDB 2004, Proceedings of 30th International Conference on Very Large Data Bases, pp. 780–791. Morgan Kaufmann, Toronto (2004) · doi:10.1016/b978-012088469-8.50069-3
  20. Keogh E. and Ratanamahatana C.A. (2004). Exact indexing of dynamic time warping. Knowl. Inf. Syst. 7(3): 358–386 · DOI · Paper page
  21. Kosugi, N., Sakurai, Y., Morimoto, M.: SoundCompass: a practical query-by-humming system; normalization of scalable and shiftable time-series data and effective subsequence generation. In: SIGMOD ’04: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, pp. 881–886. ACM Press, New York (2004) · doi:10.1145/1007568.1007677
  22. Matessi G., Pilastro A. and Marin G. (2000). Variation in quantitative properties of song among European populations of the reed bunting (Emberiza schoeniclus) with respect to bill morphology. Can. J. Zool 78: 428–437 · doi:10.1139/z99-233
  23. Meek, C., Birmingham, W.: The dangers of parsimony in query-by-humming applications. In: Proceedings of International Symposium on Music Information Retrieval (2003)
  24. Moeller-Levet, C., Klawonn, F., Cho, K.H., Wolkenhauer, O.: Fuzzy clustering of short time series and unevenly distributed sampling points. In: Proceedings of IDA (2003) · DOI
  25. Moon, Y.S., Whang, K.Y., Loh, W.K.: Duality-based subsequence matching in time-series databases. In: Proceedings of the 17th International Conference on Data Engineering, pp. 263–272. IEEE, IEEE Computer Society, Heidelberg, Germany (2001) · doi:10.1109/icde.2001.914837
  26. Pullen K., Bregler C.: (2002) Motion capture assisted animation: Texturing and synthesis. ACM Trans. Graph. (Proc SIGGRAPH 2002) 22(3) · DOI · Paper page
  27. Ratanamahatana, C.A., Keogh, E.: Everything you know about dynamic time warping is wrong. In: Third Workshop on Mining Temporal and Sequential Data, in conjunction with the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2004), Seattle, WA (2004)
  28. Ratanamahatana, C.A., Keogh, E.: Three myths about dynamic time warping data mining. In: Proceedings of the 5th SIAM International Conference on Data Mining, Newport Beach, CA (2005) · DOI · Paper page
  29. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD ’95: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pp. 71–79. ACM Press, New York (1995) · DOI · Paper page
  30. Sakoe H. and Chiba S. (1978). Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans. Acoust. Speech Signal Process. 26(1): 43–49 · DOI · Paper page
  31. Seidl, T., Kriegel, H.P.: Optimal multi-step k-nearest neighbor search. In: SIGMOD ’98: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp. 154–165. ACM Press, Seattle (1998) · DOI · Paper page
  32. Vlachos, M., Kollios, G., Gunopoulos, D.: An discovering similar multidimensional trajectories. In: Proceedings of the 18th International Conference on Data Engineering, pp. 673–684. IEEE, IEEE Computer Society, San Jose, CA (2002) · DOI · Paper page
  33. Wong, T.S.F., Wong, M.H.: Efficient subsequence matching for sequences databases under time warping. In: Proceedings of the Seventh International Database Engineering and Applications Symposium. IEEE, IEEE Computer Society, Hong Kong, SAR (2003) · doi:10.1109/ideas.2003.1214921
  34. Yi, B.K., Faloutsos, C.: Fast time sequence indexing for arbitrary $${\mathcal{L}_p}$$ norms. In: VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, pp. 385–394. Morgan Kaufmann, Cairo (2000)
  35. Yi, B.K., Jagadish, H.V., Faloutsos, C.: Efficient retrieval of similar time sequences under time warping. In: Proceedings of the 14th International Conference on Data Engineering. IEEE, IEEE Computer Society, Orlando, Florida (1998)
  36. Zhu, Y., Shasha, D.: Warping indexes with envelope transforms for query by humming. In: SIGMOD ’03: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 181–192. ACM Press, San Diego (2003) · doi:10.1145/872757.872780

Cited by

See all 219

Metadata

Authors
Fu, A. W.-C., Keogh, E., Lau, L. Y. H., Ratanamahatana, C. A., & Wong, R. C.-W.
Venue
The VLDB Journal
Published
2007-03-07
Volume
17
Issue
4
Pages
899-921
ISSN
  • 0949-877X (ISSN-L)
  • 1066-8888
OpenAlex
W2129330015
Cited by
219
References
0
FWCI
22.62
Type
journal article
Language
en
Open access
closed
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: Scaling and time warping in time series querying. https://app.cochat.ai/papers/10.1007/s00778-006-0040-z
The paper
Fu, A. W.-C., Keogh, E., Lau, L. Y. H., Ratanamahatana, C. A., & Wong, R. C.-W. (2008). Scaling and time warping in time series querying. The VLDB Journal. https://doi.org/10.1007/s00778-006-0040-z

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.