Fast time-series searching with scaling and shifting
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 237-248
- https://doi.org/10.1145/303976.304000
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A fast projection algorithm for sequence data searchingData & Knowledge Engineering, 1998
- Dimensionality reduction for similarity searching in dynamic databasesPublished by Association for Computing Machinery (ACM) ,1998
- Similarity-based queries for time series dataPublished by Association for Computing Machinery (ACM) ,1997
- Time-series similarity problems and well-separated geometric setsPublished by Association for Computing Machinery (ACM) ,1997
- Matching and indexing sequences of different lengthsPublished by Association for Computing Machinery (ACM) ,1997
- The SR-treePublished by Association for Computing Machinery (ACM) ,1997
- Similarity-based queriesPublished by Association for Computing Machinery (ACM) ,1995
- Fast subsequence matching in time-series databasesPublished by Association for Computing Machinery (ACM) ,1994
- The R*-tree: an efficient and robust access method for points and rectanglesPublished by Association for Computing Machinery (ACM) ,1990
- R-treesPublished by Association for Computing Machinery (ACM) ,1984