Sciweavers

42 search results - page 3 / 9
» Approximate embedding-based subsequence matching of time ser...
Sort
View
127
Voted
ICDM
2005
IEEE
147views Data Mining» more  ICDM 2005»
15 years 9 months ago
Partial Elastic Matching of Time Series
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 ...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
109
Voted
DAWAK
2000
Springer
15 years 8 months ago
AIM: Approximate Intelligent Matching for Time Series Data
Edward Kim, Joyce M. W. Lam, Jiawei Han
147
Voted
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
15 years 9 months ago
Elastic Partial Matching of Time Series
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 ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...
155
Voted
PETRA
2010
ACM
15 years 5 months ago
Benchmarking dynamic time warping for music retrieval
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...
Jefrey Lijffijt, Panagiotis Papapetrou, Jaakko Hol...
127
Voted
ICDM
2007
IEEE
227views Data Mining» more  ICDM 2007»
15 years 10 months ago
Optimal Subsequence Bijection
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...
Longin Jan Latecki, Qiang Wang, Suzan Koknar-Tezel...