Fast retrieval of time series using a multi-resolution filter with multiple reduced spaces

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Fast retrieval of time series that are similar to a given pattern in large databases is a problem which has received a lot of attention in the last decade. The high dimensionality and large size of time series databases make sequential scanning inefficient to handle the similarity search problem. Several dimensionality reduction techniques have been proposed to reduce the complexity of the similarity search. Multi-resolution techniques are methods that speed-up the similarity search problem by economizing distance computations. In this paper we revisit two of previously proposed methods and present an improved algorithm that combine the advantages of these two methods. We conduct extensive experiments that show the show the superior performance of the improved algorithm over the previously proposed techniques. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Fuad, M. M. M., & Marteau, P. F. (2010). Fast retrieval of time series using a multi-resolution filter with multiple reduced spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6440 LNAI, pp. 137–148). https://doi.org/10.1007/978-3-642-17316-5_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free