14 search results - page 2 / 3 » Exact indexing for massive time series databases under time ... |
SIGMOD
2001
ACM
14 years 5 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
PKDD
2005
Springer
13 years 10 months 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 ...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...
VLDB
2004
ACM
13 years 10 months ago
2004
ACM
Data-driven animation has become the industry standard for computer games and many animated movies and special effects. In particular, motion capture data recorded from live actor...
ICDM
2010
IEEE
13 years 3 months ago
2010
IEEE
Many time series data mining problems require subsequence similarity search as a subroutine. While this can be performed with any distance measure, and dozens of distance measures ...