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

Indexing of Compressed Time Series

Abstract: We describe a procedure for identifying major minima and maxima of a time series, and present two applications of this procedure. The first application is fast compression of a series, by selecting major extrema and discarding the other points. The compression algorithm runs in linear time and takes constant memory. The second application is indexing of compressed series by their major extrema, and retrieval of series similar to a given pattern. The retrieval procedure searches for the series whose compressed … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
14
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
4
4

Relationship

2
6

Authors

Journals

citations
Cited by 29 publications
(14 citation statements)
references
References 44 publications
0
14
0
Order By: Relevance
“…We can also apply the same concept of importance levels to indexing a database of time series by their minima and maxima, which allows fast retrieval of series similar to a given pattern. We have described this indexing technique in Gandhi's master's thesis (Gandhi 2004), which is a continuation of the work by Fink and Pratt (2003) on indexing of time series. Figure 13.…”
Section: Discussionmentioning
confidence: 99%
“…We can also apply the same concept of importance levels to indexing a database of time series by their minima and maxima, which allows fast retrieval of series similar to a given pattern. We have described this indexing technique in Gandhi's master's thesis (Gandhi 2004), which is a continuation of the work by Fink and Pratt (2003) on indexing of time series. Figure 13.…”
Section: Discussionmentioning
confidence: 99%
“…We can also apply the same concept of importance levels to index a database of time series by their minima and maxima, which allows fast retrieval of series similar to a given pattern. We have described this indexing technique in Gandhi's masters thesis [2], which is a continuation of the work by Pratt and Fink on the indexing of time series [1,8].…”
Section: Discussionmentioning
confidence: 99%
“…For querying the Landmark sequence, they recommended that the Landmark sequence must be more similar to a string sequence, rather than a multidimensional sequence; thus, string indexing is more suitable than the use of R-tree. Similar concepts regarding the identification of important points can be found in studies conducted in (Pratt and Fink, 2002;Fink and Pratt, 2003). They compressed a time series by selecting some of the minima and maxima or important points of peaks and troughs and dropping the other points.…”
Section: Introductionmentioning
confidence: 85%