Output details
11 - Computer Science and Informatics
Birkbeck College
Return to search
Output 0 of 0 in the submission
Article title
Embedding-based subsequence matching in time-series databases
Type
D - Journal article
Title of journal
ACM Transactions on Database Systems
Article number
-
Volume number
36
Issue number
3
First page of article
1
ISSN of journal
03625915
Year of publication
2011
URL
-
Number of additional authors
4
Additional information
<15> Efficient time series subsequence matching is challenging due to the massive amounts of data. This is the first framework to tackle this problem using embeddings, obtaining significant speedups compared with existing methods. This paper is a substantial extension of the paper "Approximate Embedding-Based Subsequence Matching of Time Series" that appeared in the premier international conference ACM SIGMOD in 2008 (and has extensive citations in Google Scholar). This work was presented in a Keynote talk by Papapetrou at PETRA 2013.
Interdisciplinary
-
Cross-referral requested
-
Research group
B - Information Management and Web Technologies
Citation count
6
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
