Indexing of Compressed Time Series
Indexing of Compressed Time Series
复制标题
压缩时间序列的索引
DOI：
10.1142/9789812565402_0003
复制
发表时间：
2004
影响因子：
4.8
通讯作者：
Kevin B. Pratt
中科院分区：
文献类型：
--
作者：
Eugene Fink;Kevin B. Pratt
我们描述了一个程序，用于确定主要的极小值和极大值的时间序列，并提出了两个应用程序。第一个应用是快速压缩的一系列，通过选择主要的极值和丢弃其他点。压缩算法在线性时间内运行，并占用恒定的内存。第二个应用是索引压缩系列的主要极值，和检索的系列类似于一个给定的模式。检索过程搜索其压缩表示与压缩模式相似的系列。它允许用户控制检索的速度和准确性之间的权衡。我们的压缩和检索的有效性，股票图表，气象数据，和脑电图。
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 representation is similar to the compressed pattern. It allows the user to control the trade-off between the speed and accuracy of retrieval. We show the effectiveness of the compression and retrieval for stock charts, meteorological data, and electroencephalograms.