Skip to main content
Log in

Scaling and time warping in time series querying

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

The last few years have seen an increasing understanding that dynamic time warping (DTW), a technique that allows local flexibility in aligning time series, is superior to the ubiquitous Euclidean distance for time series classification, clustering, and indexing. More recently, it has been shown that for some problems, uniform scaling (US), a technique that allows global scaling of time series, may just be as important for some problems. In this work, we note that for many real world problems, it is necessary to combine both DTW and US to achieve meaningful results. This is particularly true in domains where we must account for the natural variability of human actions, including biometrics, query by humming, motion-capture/animation, and handwriting recognition. We introduce the first technique which can handle both DTW and US simultaneously, our techniques involve search pruning by means of a lower bounding technique and multi-dimensional indexing to speed up the search. We demonstrate the utility and effectiveness of our method on a wide range of problems in industry, medicine, and entertainment.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  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)

  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)

  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

    Article  Google Scholar 

  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)

  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)

  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

    Article  Google Scholar 

  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)

  13. Hjaltason G.R. and Samet H. (1999). Distance browsing in spatial databases. ACM Trans. Database Syst. 24(2): 265–318

    Article  Google Scholar 

  14. Itakura F. (1975). Minimum prediction residual principle applied to speech recognition. IEEE Trans. Acoust. Speech Signal Process. 23(1): 67–72

    Article  Google Scholar 

  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)

  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)

  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)

  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

    Article  MATH  Google Scholar 

  19. Keogh, E., Folias, T.: The UCR Time Series Data Mining Archive. University of California, Computer Science & Engineering Department, Riverside. (Available at http://www.cs.ucr.edu/ eamonn/TSDMA/index.html (2002))

  20. 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)

  21. Keogh E. and Ratanamahatana C.A. (2004). Exact indexing of dynamic time warping. Knowl. Inf. Syst. 7(3): 358–386

    Article  Google Scholar 

  22. 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)

  23. 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

    Article  Google Scholar 

  24. Meek, C., Birmingham, W.: The dangers of parsimony in query-by-humming applications. In: Proceedings of International Symposium on Music Information Retrieval (2003)

  25. 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)

  26. Moon, Y.S., Whang, K.Y., Loh, W.K.: Efficient time-series subsequence matching using duality in constructing windows. Technical Report 00-11-001. Advanced Information Technology Research Center (AITrc), KAIST, Taejon, Korea (2000)

  27. 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)

  28. Pullen K., Bregler C.: (2002) Motion capture assisted animation: Texturing and synthesis. ACM Trans. Graph. (Proc SIGGRAPH 2002) 22(3)

  29. 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)

  30. 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)

  31. 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)

  32. Sakoe H. and Chiba S. (1978). Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans. Acoust. Speech Signal Process. 26(1): 43–49

    Article  MATH  Google Scholar 

  33. 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)

  34. 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)

  35. 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)

  36. 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)

  37. 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)

  38. 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)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ada Wai-Chee Fu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fu, A.WC., Keogh, E., Lau, L.Y.H. et al. Scaling and time warping in time series querying. The VLDB Journal 17, 899–921 (2008). https://doi.org/10.1007/s00778-006-0040-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-006-0040-z

Keywords

Navigation