Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Locally adaptive dimensionality reduction for indexing large time series databases
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Searching Multimedia Databases by Content
Searching Multimedia Databases by Content
Efficient Retrieval of Similar Time Sequences Under Time Warping
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases
Proceedings of the 17th International Conference on Data Engineering
Haar Wavelets for Efficient Similarity Search of Time-Series: With and Without Time Warping
IEEE Transactions on Knowledge and Data Engineering
Warping indexes with envelope transforms for query by humming
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
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
FTW: fast similarity search under the time warping distance
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximation Techniques for Indexing the Earth Mover's Distance in Multimedia Databases
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Evaluation campaigns and TRECVid
MIR '06 Proceedings of the 8th ACM international workshop on Multimedia information retrieval
Exact indexing of dynamic time warping
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
On the marriage of Lp-norms and edit distance
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Toward accurate dynamic time warping in linear time and space
Intelligent Data Analysis
Approximate embedding-based subsequence matching of time series
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proceedings of the VLDB Endowment
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
Pattern detector: fast detection of suspicious stream patterns for immediate reaction
Proceedings of the 13th International Conference on Extending Database Technology
A new approach for processing ranked subsequence matching based on ranked union
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Embedding-based subsequence matching in time-series databases
ACM Transactions on Database Systems (TODS)
Efficient processing of multiple DTW queries in time series databases
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Speeding up complex video copy detection queries
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
A generic framework for efficient and effective subsequence retrieval
Proceedings of the VLDB Endowment
Revisiting techniques for lowerbounding the dynamic time warping distance
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
ACM Computing Surveys (CSUR)
HTTP: a new framework for bus travel time prediction based on historical trajectories
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Experimental comparison of representation methods and distance measures for time series data
Data Mining and Knowledge Discovery
Pattern discovery in data streams under the time warping distance
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.01 |
Time series arise in many different applications in the form of sensor data, stocks data, videos, and other time-related information. Analysis of this data typically requires searching for similar time series in a database. Dynamic Time Warping (DTW) is a widely used high-quality distance measure for time series. As DTW is computationally expensive, efficient algorithms for fast computation are crucial. In this paper, we propose a novel filter-and-refine DTW algorithm called Anticipatory DTW. Existing algorithms aim at efficiently finding similar time series by filtering the database and computing the DTW in the refinement step. Unlike these algorithms, our approach exploits previously unused information from the filter step during the refinement, allowing for faster rejection of false candidates. We characterize a class of applicable filters for our approach, which comprises state-of-the-art lower bounds of the DTW. Our novel anticipatory pruning incurs hardly any over-head and no false dismissals. We demonstrate substantial efficiency improvements in thorough experiments on synthetic and real world time series databases and show that our technique is highly scalable to multivariate, long time series and wide DTW bands.