22nd International Conference on Data Engineering (ICDE'06) 2006
DOI: 10.1109/icde.2006.160
|View full text |Cite
|
Sign up to set email alerts
|

Threshold Similarity Queries in Large Time Series Databases

Abstract: Similarity search in time series data is an active area of research. In this paper, we introduce the novel concept of threshold-similarity queries in time series databases which report those time series exceeding a user-defined query threshold at similar time frames compared to the query time series. In addition, we present a new data structure to support threshold similarity queries efficiently. The performance of our solution is demonstrated by an extensive experimental evaluation.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2009
2009
2015
2015

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 4 publications
0
10
0
Order By: Relevance
“…As proposed in [3,4], time series considering a single time domain can be represented as a sequence of intervals according to a certain threshold value τ . For the recognition of relevant periodic patterns that are hidden in the matrix representation of dual-domain time series, we extend this approach to a novel abstract meaning.…”
Section: Intersection Setsmentioning
confidence: 99%
See 2 more Smart Citations
“…As proposed in [3,4], time series considering a single time domain can be represented as a sequence of intervals according to a certain threshold value τ . For the recognition of relevant periodic patterns that are hidden in the matrix representation of dual-domain time series, we extend this approach to a novel abstract meaning.…”
Section: Intersection Setsmentioning
confidence: 99%
“…Considering the single-domain representation of time series, we performed similarity queries on the given datasets utilizing the techniques that are applicable for computing similarity on single-domain time series, such as the Euclidean distance (in the following denoted as EUCL), the DTW [7] and the threshold-based approach [3,4], in the following referred to as THR. Later in this section, we outline the obtained results of our newly introduced approach of measuring the distances for comparison.…”
Section: Effectiveness Of the Time Series Representationmentioning
confidence: 99%
See 1 more Smart Citation
“…An intersection set P τ (X) of a time series X is created by a set of polygons that are derived according to [2], where time series with one time domain are represented as a sequence of intervals w.r.t. to a threshold value τ .…”
Section: Theoretical Backgroundmentioning
confidence: 99%
“…Beyond the interest of [2], the temporal location and the evolution of consecutive patterns are focused. For efficient similarity computation, relevant feature information is extracted so that data mining techniques can apply.…”
Section: Introductionmentioning
confidence: 99%