14 search results - page 1 / 3 » Exact indexing for massive time series databases under time ... |
DATAMINE
2010
13 years 5 months ago
2010
KDD
2012
ACM
11 years 7 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...
VLDB
2002
ACM
13 years 4 months ago
2002
ACM
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
The goal of this paper is to monitor numerical streams, and to find subsequences that are similar to a given query sequence, under the DTW (Dynamic Time Warping) distance. Applica...