2019
DOI: 10.1016/j.is.2018.08.002
|View full text |Cite
|
Sign up to set email alerts
|

Interactive and space-efficient multi-dimensional time series subsequence matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…Piatov et al propose DeltaTop, a fast time series subsequence matching method [68], where the query sequence is itself part of the dataset (i.e., self-join). Their method uses a prefix-sum Euclidean distance matrix to accelerate subsequence matching, and supports search in multi-variate time series.…”
Section: Related Workmentioning
confidence: 99%
“…Piatov et al propose DeltaTop, a fast time series subsequence matching method [68], where the query sequence is itself part of the dataset (i.e., self-join). Their method uses a prefix-sum Euclidean distance matrix to accelerate subsequence matching, and supports search in multi-variate time series.…”
Section: Related Workmentioning
confidence: 99%