2004
DOI: 10.1142/9789812565402_0002
|View full text |Cite
|
Sign up to set email alerts
|

A Survey of Recent Methods for Efficient Retrieval of Similar Time Sequences

Abstract: Time sequences occur in many applications, ranging from science and technology to business and entertainment. In many of these applications, an analysis of time series data, and searching through large, unstructured databases based on sample sequences, is often desirable. Such similarity-based retrieval has attracted a lot of attention in recent years. Although several different approaches have appeared, most are based on the common premise of dimensionality reduction and spatial access methods. This paper giv… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
39
0
4

Year Published

2005
2005
2020
2020

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 43 publications
(43 citation statements)
references
References 30 publications
(28 reference statements)
0
39
0
4
Order By: Relevance
“…One example of this technique is similarity indexing for time series, where many signature types have been suggested, normally in the form of fixeddimensional vectors that may be indexed using spatial access methods. Hetland [100] gives a survey of this application. 9.…”
Section: B An Overview Of the Indexing Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…One example of this technique is similarity indexing for time series, where many signature types have been suggested, normally in the form of fixeddimensional vectors that may be indexed using spatial access methods. Hetland [100] gives a survey of this application. 9.…”
Section: B An Overview Of the Indexing Methodsmentioning
confidence: 99%
“…For a discussion of how to deal with high-dimensional vector spaces, see the survey by Hetland [100]. It is interesting to note that the intrinsic dimensionality of a vector data set may be lower than its representational dimensionality; that is, the vectors may be mapped faithfully to a lower-dimensional vector space without distorting the distances much.…”
Section: B An Overview Of the Indexing Methodsmentioning
confidence: 99%
“…Other usable methods of discretization include those used to simplify time series for indexing purposes. See Hetland (2004) for a survey. A recent discretization method with several interesting properties is the SAX method (Lin et al, 2003).…”
Section: Discretization Algorithmmentioning
confidence: 99%
“…In the literature, most of the approaches to similarity-based time series retrieval are founded on the common premise of dimensionality reduction (see the survey in [12]). As a matter of fact, a discretized time series can always be seen as vector in an n-dimensional space (with n typically extremely large).…”
Section: Case Retrievalmentioning
confidence: 99%
“…One obvious solution is thus to reduce the time series dimensionality, by means of a transform that preserves the distance between two time series, or underestimates it: in this case a post-processing step will be required, to filter out the so-called "false alarms"; the requirement is never to overestimate the distance, so that no "false dismissals" can exist [12]. Widely used transforms are the Discrete Fourier Transform (DFT) [2], and the Discrete Wavelet Transform (DWT) [9].…”
Section: Case Retrievalmentioning
confidence: 99%