Efficient Retrieval of Similar Time Sequences Under Time Warping
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
PKDD '97 Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery
Discovery of Temporal Patterns. Learning Rules about the Qualitative Behaviour of Time Series
PKDD '01 Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery
On Similarity-Based Queries for Time Series Data
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Discovering Similar Multidimensional Trajectories
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Indexing multi-dimensional time-series with support for multiple distance measures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Probabilistic discovery of time series motifs
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Towards parameter-free data mining
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
A Multiresolution Symbolic Representation of Time Series
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Elastic partial matching of time series
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
An elastic partial shape matching technique
Pattern Recognition
Detection and recognition of contour parts based on shape similarity
Pattern Recognition
Target classification in sparse sampling acoustic sensor networks using IDDC algorithm
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
A review on time series data mining
Engineering Applications of Artificial Intelligence
Modeling television schedules for television stream structuring
MMM'07 Proceedings of the 13th international conference on Multimedia Modeling - Volume Part I
| Hi-index | 0.00 |
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 proposed algorithm we map the problem of the best matching subsequence to the problem of a cheapest path in a DAG (directed acyclic graph). The proposed approach allows us to also compute the optimal scale and translation of time series values, which is a nontrivial problem in the case of subsequence matching.