68 search results - page 3 / 14 » Quantizing Time Series for Efficient Subsequence Matching |
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
TCS
2008
13 years 9 months ago
2008
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
PETRA
2009
ACM
14 years 3 months ago
2009
ACM
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
ICDM
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
EDBT
2006
ACM
14 years 9 months ago
2006
ACM
Similarity search in time series data is required in many application fields. The most prominent work has focused on similarity search considering either complete time series or si...