68 search results - page 4 / 14 » Quantizing Time Series for Efficient Subsequence Matching |
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
ICDE
1999
IEEE
14 years 9 months ago
1999
IEEE
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
34
Voted
IS
2008
13 years 7 months ago
2008
We propose a dimensionality reduction technique for time series analysis that significantly improves the efficiency and accuracy of similarity searches. In contrast to piecewise c...
PKDD
2005
Springer
14 years 1 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 ...