The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A fast branch & bound nearest neighbour classifier in metric spaces
Pattern Recognition Letters
ACM Computing Surveys (CSUR)
Searching Multimedia Databases by Content
Searching Multimedia Databases by Content
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Warping indexes with envelope transforms for query by humming
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Shape Matching: Similarity Measures and Algorithms
SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Pattern Analysis and Machine Intelligence
WARP: Accurate Retrieval of Shapes Using Phase of Fourier Descriptors and Time Warping Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Exact indexing of dynamic time warping
Knowledge and Information Systems
FTW: fast similarity search under the time warping distance
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Atomic Wedgie: Efficient Query Filtering for Streaming Times Series
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Quantizing time series for efficient similarity search under time warping
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
On-line signature recognition based on VQ-DTW
Pattern Recognition
Fast k-nearest-neighbor search based on projection and triangular inequality
Pattern Recognition
Engineering efficient metric indexes
Pattern Recognition Letters
An efficient and accurate method for evaluating time series similarity
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient Many-To-Many Point Matching in One Dimension
Graphs and Combinatorics
Modified Dynamic Time Warping for Stroke-Based On-line Signature Verification
ICDAR '07 Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02
On the marriage of Lp-norms and edit distance
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Streaming maximum-minimum filter using no more than three comparisons per element
Nordic Journal of Computing
Chromosome classification using dynamic time warping
Pattern Recognition Letters
An energy-based similarity measure for time series
EURASIP Journal on Advances in Signal Processing
Contour-Based shape retrieval using dynamic time warping
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
A General Framework of Progressive Filtering and Its Application to Query by Singing/Humming
IEEE Transactions on Audio, Speech, and Language Processing
Histogram distance for similarity search in large time series database
IDEAL'10 Proceedings of the 11th international conference on Intelligent data engineering and automated learning
On classifying drifting concepts in P2P networks
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
Computationally efficient, one-pass algorithm for morphological filters
Journal of Visual Communication and Image Representation
Weighted dynamic time warping for time series classification
Pattern Recognition
Proceedings of the Third Symposium on Information and Communication Technology
Comparing three lower bounding methods for DTW in time series classification
Proceedings of the Third Symposium on Information and Communication Technology
Time series classification by class-specific Mahalanobis distance measures
Advances in Data Analysis and Classification
Area bound dynamic time warping based fast and accurate person authentication using a biometric pen
Digital Signal Processing
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Experimental comparison of representation methods and distance measures for time series data
Data Mining and Knowledge Discovery
SparseDTW: a novel approach to speed up dynamic time warping
AusDM '09 Proceedings of the Eighth Australasian Data Mining Conference - Volume 101
Instruction set extensions for dynamic time warping
Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis
Discovering common motifs in cursor movement data for improving web search
Proceedings of the 7th ACM international conference on Web search and data mining
Asynchronism-based principal component analysis for time series data mining
Expert Systems with Applications: An International Journal
| Hi-index | 0.02 |
The dynamic time warping (DTW) is a popular similarity measure between time series. The DTW fails to satisfy the triangle inequality and its computation requires quadratic time. Hence, to find closest neighbors quickly, we use bounding techniques. We can avoid most DTW computations with an inexpensive lower bound (LB_Keogh). We compare LB_Keogh with a tighter lower bound (LB_Improved). We find that LB_Improved-based search is faster. As an example, our approach is 2-3 times faster over random-walk and shape time series.