This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third IEEE International Conference on Data Mining (ICDM'03)
Efficient Subsequence Matching in Time Series Databases Under Time and Amplitude Transformations
Melbourne, Florida
November 19-November 22
ISBN: 0-7695-1978-4
Tassos Argyros, National Technical University of Athens, Greece
Charis Ermopoulos, National Technical University of Athens, Greece
Subsequence matching in large time series databases has attracted a lot of interest and many methods have been proposed that cope with this problem in an adequate extend. However, locating subsequence matches of arbitrary length, under time and amplitude transformations, has received far less attention and is still an open problem. In this paper we present an efficient algorithm for variable-length subsequence matching under transformations that guarantees no false dismissals. Further, this algorithm uses a novel similarity criterion for determining similarity under amplitude transformations in a most efficient way. Finally, our algorithm has been tested in various experiments on real data, resulting in a running time improvement of one order of magnitude compared to the naive approach.
Citation:
Tassos Argyros, Charis Ermopoulos, "Efficient Subsequence Matching in Time Series Databases Under Time and Amplitude Transformations," icdm, pp.481, Third IEEE International Conference on Data Mining (ICDM'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.