ACM Home Page
Please provide us with feedback. Feedback
FTW: fast similarity search under the time warping distance
Full text PdfPdf (332 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems table of contents
Baltimore, Maryland
SESSION: Research session 9: databases & information retrieval / data mining table of contents
Pages: 326 - 337  
Year of Publication: 2005
ISBN:1-59593-062-0
Authors
Yasushi Sakurai  NTT Cyber Space Laboratories
Masatoshi Yoshikawa  Nagoya University
Christos Faloutsos  Carnegie Mellon University
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGMOD: ACM Special Interest Group on Management of Data
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 70,   Citation Count: 14
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1065167.1065210
What is a DOI?

ABSTRACT

Time-series data naturally arise in countless domains, such as meteorology, astrophysics, geology, multimedia, and economics. Similarity search is very popular, and DTW (Dynamic Time Warping) is one of the two prevailing distance measures. Although DTW incurs a heavy computation cost, it provides scaling along the time axis. In this paper, we propose FTW (Fast search method for dynamic Time Warping), which guarantees no false dismissals in similarity query processing. FTW efficiently prunes a significant number of the search cost. Experiments on real and synthetic sequence data sets reveals that FTW is significantly faster than the best existing method, up to 222 times.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
4
 
5
 
6
S. Chu, E. Keogh, D. Hart, and M. Pazzani. Iterative deepening dynamic time warping for time series. In Proceedings of SIAM International Conference on Data Mining, 2002.
 
7
8
 
9
 
10
R. W. Hamming. Digital Filters. Englewood Cliffs, N. J., 1977.
 
11
K. J. Jacob and D. Shasha. Fintime --- a financial time series benchmark. http://cs.nyu.edu/cs/faculty/shasha/fintime.html, March 2000.
12
13
 
14
E. J. Keogh. Exact indexing of dynamic time warping. In Proceedings of VLDB, pages 406--417, August 2002.
15
 
16
E. J. Keogh, K. Chakrabarti, M. J. Pazzani, and S. Mehrotra. Dimensionality reduction for fast similarity search in large time series databases. Journal of Knowledge and Information Systems, pages 263--286, 2000.
 
17
18
 
19
D. W. Mount. Bioinfomatics: Sequence and Genome Analysis. Cold Spring Harbor, New York, 2000.
 
20
A. V. Oppenheim and R. W. Schafer. Digital Signal Processing. Englewood Cliffs, N. J., 1975.
 
21
 
22
 
23
 
24
 
25
 
26
27

CITED BY  14
Collaborative Colleagues:
Yasushi Sakurai: colleagues
Masatoshi Yoshikawa: colleagues
Christos Faloutsos: colleagues