Fundamentals of speech recognition
Fundamentals of speech recognition
Segment-based approach for subsequence searches in sequence databases
Proceedings of the 2001 ACM symposium on Applied computing
Proceedings of the tenth international conference on Information and knowledge management
Shape-based retrieval of similar subsequences in time-series databases
Proceedings of the 2002 ACM symposium on Applied computing
Efficient Retrieval of Similar Time Sequences Under Time Warping
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Fast Time Sequence Indexing for Arbitrary Lp Norms
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases
Proceedings of the 17th International Conference on Data Engineering
Efficient Searches for Similar Subsequences of Different Lengths in Sequence Databases
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Warping indexes with envelope transforms for query by humming
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Indexing Multidimensional Time-Series
The VLDB Journal — The International Journal on Very Large Data Bases
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Affine Invariant Dynamic Time Warping and its Application to Online Rotated Handwriting Recognition
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 02
A Time Warping Based Approach for Video Copy Detection
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
An Adaptable Time Warping Distance for Time Series Learning
ICMLA '06 Proceedings of the 5th International Conference on Machine Learning and Applications
Exact indexing of dynamic time warping
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Using multiple indexes for efficient subsequence matching in time-series databases
Information Sciences: an International Journal
Sentence Similarity based on Dynamic Time Warping
ICSC '07 Proceedings of the International Conference on Semantic Computing
Indexing large human-motion databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A Leaf Image Retrieval Scheme Based on Partial Dynamic Time Warping and Two-Level Filtering
CIT '07 Proceedings of the 7th IEEE International Conference on Computer and Information Technology
Information Sciences: an International Journal
Scaling and time warping in time series querying
The VLDB Journal — The International Journal on Very Large Data Bases
A Study on the Dynamic Time Warping in Kernel Machines
SITIS '07 Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System
Measuring text similarity with dynamic time warping
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Fast correlation analysis on time series datasets
Proceedings of the 17th ACM conference on Information and knowledge management
DAS '08 Proceedings of the 2008 The Eighth IAPR International Workshop on Document Analysis Systems
Information Sciences: an International Journal
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
A segment-wise time warping method for time scaling searching
Information Sciences: an International Journal
Exact indexing for massive time series databases under time warping distance
Data Mining and Knowledge Discovery
Adaptive fuzzy clustering based anomaly data detection in energy system of steel industry
Information Sciences: an International Journal
| Hi-index | 0.07 |
Dynamic time warping (DTW) is a powerful technique in the time-series similarity search. However, its performance on large-scale data is unsatisfactory because of its high computational cost and the fact that it cannot be indexed directly. The lower bound technique for DTW is an effective solution to this problem. In this paper, we explain the existing lower-bound functions from a unified perspective and show that they are only special cases under our framework. We then propose a group of lower-bound functions for DTW and compare their performances through extensive experiments. The experimental results show that the new methods are better than the existing ones in most cases, and a theoretical explanation of the results is also given. We further implement an index structure based on the new lower-bound function. Experimental results demonstrate a similar conclusion.