Sciweavers

Share
7 search results - page 1 / 2
» Elastic Partial Matching of Time Series
Sort
View
ICDM
2005
IEEE
147views Data Mining» more  ICDM 2005»
12 years 7 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...
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
12 years 7 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...
CORR
2008
Springer
117views Education» more  CORR 2008»
12 years 1 months ago
Time Warp Edit Distance
: This technical report details a family of time warp distances on the set of discrete time series. This family is constructed as an editing distance whose elementary operations ap...
Pierre-Francois Marteau
ICDM
2007
IEEE
227views Data Mining» more  ICDM 2007»
12 years 8 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...
EDBT
2006
ACM
120views Database» more  EDBT 2006»
13 years 2 months ago
Similarity Search on Time Series Based on Threshold Queries
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...
Johannes Aßfalg, Hans-Peter Kriegel, Peer Kr...
books