19 search results - page 2 / 4 » Fast Subsequence Matching in Time-Series Databases |
KDD
1997
ACM
13 years 9 months ago
1997
ACM
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
SSDBM
1999
IEEE
13 years 9 months ago
1999
IEEE
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
ICDE
1999
IEEE
14 years 6 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 ...
ICDE
2009
IEEE
14 years 6 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...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
Monitoring predefined patterns in streaming time series is useful to applications such as trend-related analysis, sensor networks and video surveillance. Most current studies on s...