Sciweavers

Share
DBA
2006

Quantizing Time Series for Efficient Subsequence Matching

9 years 5 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data space using different metrics. However, searching high-dimensional spaces using a hierarchical index is not always efficient because a large portion of the index might need to be accessed during search. We have revisited this problem of matching subsequences in light of new technological advances. In particular, we have paid close attention to the increasing ratio of CPU to disk performance. We recognize this problem is heavily bound by IO operations and address this issue in a twofold manner. First, we propose the use of quantization to generate small and homogeneous representations of time series. Quantization provides tight upper- and lower-bounds on the measure of similarity to a query sequence. This allows us to drastically reduce the number of false alarms during search. Second, we organize the quantize...
Inés Fernando Vega López, Bongki Moo
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2006
Where DBA
Authors Inés Fernando Vega López, Bongki Moon
Comments (0)
books