Grid-based indexing for large time series databases

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

Abstract

Similarity search in large time series databases is an interesting and challenging problem. Because of the high dimensional nature of the data, the difficulties associated with dimensionality curse arise. The most promising solution is to use dimensionality reduction, and construct a multi-dimensional index structure for the reduced data. In this work we introduce a new approach called grid-based Datawise Dimensionality Reduction(DDR) which attempts to preserve the characteristics of time series. We then apply quantization to construct an index structure. An experimental comparison with existing techniques demonstrate the utility of our approach. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

An, J., Chen, H., Furuse, K., Ohbo, N., & Keogh, E. (2004). Grid-based indexing for large time series databases. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2690, 614–621. https://doi.org/10.1007/978-3-540-45080-1_83

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