Embedding-based subsequence matching in time-series databases

Authors:
Panagiotis Papapetrou;Vassilis Athitsos;Michalis Potamias;George Kollios;Dimitrios Gunopulos
Affiliations:
Aalto University, Finland;University of Texas at Arlington, TX;Boston University, Boston, MA;Boston University, Boston, MA;University of Athens, Greece
Venue:
ACM Transactions on Database Systems (TODS)
Year:
2011

Citing 56
Cited 7

Fast subsequence matching in time-series databases

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Similarity-based queries for time series data

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Dimensionality reduction for similarity searching in dynamic databases

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
q-gram based database searching using a suffix array (QUASAR)

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
An HMM-Based Threshold Model Approach for Gesture Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Scaling up dynamic time warping for datamining applications

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Dimensionality reduction and similarity computation by inner product approximations

Proceedings of the ninth international conference on Information and knowledge management
Segment-based approach for subsequence searches in sequence databases

Proceedings of the 2001 ACM symposium on Applied computing
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases

ACM Computing Surveys (CSUR)
General match: a subsequence matching method in time-series databases based on generalized windows

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Clustering for Approximate Similarity Search in High-Dimensional Spaces

IEEE Transactions on Knowledge and Data Engineering
VQ-index: an index structure for similarity searching in multimedia databases

Proceedings of the tenth ACM international conference on Multimedia
Trading Quality for Time with Nearest Neighbor Search

EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Efficient Retrieval of Similar Time Sequences Under Time Warping

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Duality-Based Subsequence Matching in Time-Series Databases

Proceedings of the 17th International Conference on Data Engineering
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Similarity Search in High Dimensions via Hashing

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
A New Indexing Method for Approximate String Matching

CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Properties of Embedding Methods for Similarity Searching in Metric Spaces

IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Time Series Matching by Wavelets

ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Cluster-preserving Embedding of Proteins

Cluster-preserving Embedding of Proteins
Warping indexes with envelope transforms for query by humming

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Discovering Similar Multidimensional Trajectories

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Similarity search of time-warped subsequences via a suffix tree

Information Systems
Efficient Subsequence Matching in Time Series Databases Under Time and Amplitude Transformations

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
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
Index-driven similarity search in metric spaces (Survey Article)

ACM Transactions on Database Systems (TODS)
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Rotation invariant distance measures for trajectories

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Fast and Exact Warping of Time Series Using Adaptive Segmental Approximations

Machine Learning
FTW: fast similarity search under the time warping distance

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Robust and fast similarity search for moving object trajectories

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Subsequence matching on structured time series data

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Query-sensitive embeddings

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Reference-based indexing of sequence databases

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
An efficient and accurate method for evaluating time series similarity

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Experiencing SAX: a novel symbolic representation of time series

Data Mining and Knowledge Discovery
Exact indexing of dynamic time warping

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
OASIS: an online and accurate technique for local-alignment searches on biological sequences

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On the marriage of Lp-norms and edit distance

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
VGRAM: improving performance of approximate queries on string collections using variable-length grams

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Ranked subsequence matching in time-series databases

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Approximate embedding-based subsequence matching of time series

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Scaling and time warping in time series querying

The VLDB Journal — The International Journal on Very Large Data Bases
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
Similarity Search in Arbitrary Subspaces Under Lp-Norm

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Efficient Processing of Warping Time Series Join of Motion Capture Data

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Quality and efficiency in high dimensional nearest neighbor search

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Reference-based alignment in large sequence databases

Proceedings of the VLDB Endowment
Anticipatory DTW for efficient similarity search in time series databases

Proceedings of the VLDB Endowment
BoostMap: a method for efficient approximate similarity rankings

CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Elastic partial matching of time series

PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases

Rise and fall patterns of information diffusion: model and implications

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Searching and mining trillions of time series subsequences under dynamic time warping

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast intra-collection audio matching

Proceedings of the second international ACM workshop on Music information retrieval with user-centered and multimodal strategies
Addressing Big Data Time Series: Mining Trillions of Time Series Subsequences Under Dynamic Time Warping

ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on ACM SIGKDD 2012
Online human gesture recognition from motion data streams

Proceedings of the 21st ACM international conference on Multimedia
Data mining a trillion time series subsequences under dynamic time warping

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Discovering longest-lasting correlation in sequence databases

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an embedding-based framework for subsequence matching in time-series databases that improves the efficiency of processing subsequence matching queries under the Dynamic Time Warping (DTW) distance measure. This framework partially reduces subsequence matching to vector matching, using an embedding that maps each query sequence to a vector and each database time series into a sequence of vectors. The database embedding is computed offline, as a preprocessing step. At runtime, given a query object, an embedding of that object is computed online. Relatively few areas of interest are efficiently identified in the database sequences by comparing the embedding of the query with the database vectors. Those areas of interest are then fully explored using the exact DTW-based subsequence matching algorithm. We apply the proposed framework to define two specific methods. The first method focuses on time-series subsequence matching under unconstrained Dynamic Time Warping. The second method targets subsequence matching under constrained Dynamic Time Warping (cDTW), where warping paths are not allowed to stray too much off the diagonal. In our experiments, good trade-offs between retrieval accuracy and retrieval efficiency are obtained for both methods, and the results are competitive with respect to current state-of-the-art methods.