Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9651010 | Information Sciences | 2005 | 28 Pages |
Abstract
The technique of searching for similar patterns among time series data is very important in a wide range of applications. Among them, the time scaling searching is a hard problem that only a few works have tackled. By combining the advantages of a natural time scaling transformation and the dynamic time warping method, we propose a similarity measure that is more suitable for time scaling searching than any existing one. We then explain how to calculate the proposed segment-wise time warping (STW) distance using dynamic programming. In addition, we discuss the lower bound technique of STW distance and the corresponding index method. Through different experiments, we find that the index can greatly reduce the amount of data that must be retrieved, and will lead to great improvements of performance in large sequence database compared with a sequential search.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Mi Zhou, Man Hon Wong,