68 search results - page 5 / 14 » Quantizing Time Series for Efficient Subsequence Matching |
AAIM
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
PETRA
2010
ACM
13 years 9 months ago
2010
ACM
We study the performance of three dynamic programming methods on music retrieval. The methods are designed for time series matching but can be directly applied to retrieval of mus...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
KDD
1998
ACM
14 years 3 days ago
1998
ACM
We consider the problem of nding rules relating patterns in a time series to other patterns in that series, or patterns in one series to patterns in another series. A simple examp...
KDD
2000
ACM
13 years 11 months ago
2000
ACM
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...