2002
DOI: 10.1142/s0219467802000482
|View full text |Cite
|
Sign up to set email alerts
|

Search for Patterns in Compressed Time Series

Abstract: We describe a technique for fast compression of time series, indexing of compressed series, and retrieval of series similar to a given pattern. The compression procedure identifies "important" points of a series and discards the other points. We use the important points not only for compression, but also for indexing a database of time series. Experiments show the effectiveness of this technique for indexing of stock prices, weather data and electroencephalograms.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
43
0
3

Year Published

2006
2006
2019
2019

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 120 publications
(47 citation statements)
references
References 24 publications
1
43
0
3
Order By: Relevance
“…Now we adopt a measure to analyze the difference between time series of network entropies. Following the study of Pratt and Fink [41], we use the root mean square difference to measure the difference between time series. The root mean square difference (RD) between {a1, ..., an} and {b1, ..., bn} is given as follows: From Figures 4 and 5, it can be seen that there are high values for the Renyi and Tsallis entropies during the crisis for α > 0, and low values for the same entropies during the crisis when α < 0.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Now we adopt a measure to analyze the difference between time series of network entropies. Following the study of Pratt and Fink [41], we use the root mean square difference to measure the difference between time series. The root mean square difference (RD) between {a1, ..., an} and {b1, ..., bn} is given as follows: From Figures 4 and 5, it can be seen that there are high values for the Renyi and Tsallis entropies during the crisis for α > 0, and low values for the same entropies during the crisis when α < 0.…”
Section: Resultsmentioning
confidence: 99%
“…Now we adopt a measure to analyze the difference between time series of network entropies. Following the study of Pratt and Fink [41], we use the root mean square difference to measure the difference between time series. The root mean square difference (RD) between {a 1 , ..., a n } and {b 1 , ..., b n } is given as follows:…”
Section: Resultsmentioning
confidence: 99%
“…The result of similarity measured by radian distance is exactly the same as Euclidean distance, even sorted by the distance value for Foreign Exchange Rate data. In addition, to illustrate that the RadDist is segmentation algorithm independent, we conducted two more experiments by using PLR_PF [11] and PLR_PIP [13] to compress the time series respectively. Both PLR_PF and PLR_PIP are classical piecewise linear segmentation algorithms.…”
Section: Resultsmentioning
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: 87%