Scaling and time warping in time series querying

被引:99
作者
Fu, Ada Wai-Chee [1 ]
Keogh, Eamonn [2 ]
Lau, Leo Yung Hang [1 ]
Ratanamahatana, Chotirat Ann [3 ]
Wong, Raymond Chi-Wing [1 ]
机构
[1] Chinese Univ Hong Kong, Shatin, Hong Kong, Peoples R China
[2] Univ Calif Riverside, Riverside, CA 92521 USA
[3] Chulalongkorn Univ, Dept Comp Engn, Bangkok, Thailand
关键词
dynamic time warping; nearest neighbor search; scaled and warped matching; subsequence matching; uniform scaling;
D O I
10.1007/s00778-006-0040-z
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:899 / 921
页数:23
相关论文
共 38 条
  • [1] Agrawal R., 1995, VLDB '95. Proceedings of the 21st International Conference on Very Large Data Bases, P490
  • [2] [Anonymous], 1995, SIGMOD
  • [3] BECKMANN N, 1990, SIGMOD, P322, DOI DOI 10.1145/93597.98741
  • [4] Berchtold S, 1996, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P28
  • [5] CAMPBELL LW, 1995, FIFTH INTERNATIONAL CONFERENCE ON COMPUTER VISION, PROCEEDINGS, P624, DOI 10.1109/ICCV.1995.466880
  • [6] Chai W., 2001, P INT C ART INT
  • [7] CHAN F, 1999, P 15 INT C DAT ENG I
  • [8] Dalal N, 2002, IEEE WORKSHOP ON MOTION AND VIDEO COMPUTING (MOTION 2002), PROCEEDINGS, P65, DOI 10.1109/MOTION.2002.1182215
  • [9] FALOUTSOS C, 1994, SIGMOD, P419, DOI DOI 10.1145/191839.191925
  • [10] Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances
    Fu, AW
    Chan, PM
    Cheung, YL
    Moon, YS
    [J]. VLDB JOURNAL, 2000, 9 (02) : 154 - 173