1997 · 346 citations · 18 references
ComputingComputer ScienceData MiningInformation RetrievalTime Series AnalysisComputational Time Series AnalysisNearest Neighbor SearchQuery ProcessingSequence MiningSequence Similarity SearchTime Series AnalyticsFourier Series AnalysisIndex StructuresIndexing Data StructuresSimilarity SearchSimilarity-based QueryingTime Series Similarity SearchTime WarpingTransformations
We study a set of linear transformations on the Fourier series representation of a sequence that can be used as the basis for similarity queries on time-series data. We show that our set of transformations is rich enough to formulate operations such as moving average and time warping. We present a query processing algorithm that uses the underlying R-tree index of a multidimensional data set to answer similarity queries efficiently. Our experiments show that the performance of this algorithm is competitive to that of processing ordinary (exact match) queries using the index, and much faster than sequential scanning. We relate our transformations to the general framework for similarity queries of Jagadish et al.
18
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · 1990 · 4.2K citations · Full text
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim · 1998 · 1.9K citations
Fast subsequence matching in time-series databases
Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos · 1994 · 1.7K citations · Full text
J.W. Mark · Proceedings of the IEEE · 1975 · 1.6K citations