515 search results - page 3 / 103 » Subsequence Matching on Structured Time Series Data |
SIGMOD
1994
ACM
13 years 11 months ago
1994
ACM
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
KDD
2012
ACM
11 years 9 months ago
2012
ACM
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
KDD
1999
ACM
13 years 11 months ago
1999
ACM
Most time series comparison algorithms attempt to discover what the members of a set of time series have in common. We investigate a di erent problem, determining what distinguish...
PKDD
2005
Springer
14 years 25 days ago
2005
Springer
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...