Efficient time series matching by wavelets
The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are applied to time series to reduce the number of dimensions of the feature vectors. Different transformations like Discrete Fourier Transform (DFT) Discrete Wavelet Transform (DWT), Karhunen-Loeve (KL) transform or Singular Value Decomposition (SVD) can be applied. While the use of DFT and K-L transform or SVD have been studied on the literature, to our knowledge, there is no in-depth study on the application of DWT. In this paper we propose to use Haar Wavelet Transform for time series indexing. The major contributions are: (1) we show that Euclidean distance is preserved in the Haar transformed domain and no false dismissal will occur, (2) we show that Haar transform can outperform DFT through experiments, (3) a new similarity model is suggested to accommodate vertical shift of time series, and (4) a two-phase method is proposed for efficient n-nearest neighbor query in time series databases.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1994) · doi:10.1201/9780429246593 · Cited by 40,500
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
Габор, Д. (1946) · Journal of the IEE · Cited by 5,036
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98741 · Cited by 4,161
The Analysis of Time Series: An Introduction
Dickey, D. A., & Chatfield, C. (1991) · Technometrics · doi:10.2307/1268794 · Cited by 3,525
Advances in knowledge discovery and data mining
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90007-3 · Cited by 2,971
Zur Theorie der orthogonalen Funktionensysteme: Erste Mitteilung
Haar, A. (1910) · Mathematische Annalen · doi:10.1007/bf01456326 · Cited by 2,138
Efficient similarity search in sequence databases
Agrawal, R., Faloutsos, C., & Swami, A. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57301-1_5 · Cited by 1,979
Introduction to Wavelets and Wavelet Transforms: A Primer
Burrus, C. S., Gopinath, R. A., Guo, H., Odegard, J. E., & Selesnick, I. (1997) · Cited by 1,794
Graps, A. (1995) · IEEE Computational Science and Engineering · doi:10.1109/99.388960 · Cited by 1,765
Fast subsequence matching in time-series databases
Faloutsos, C., Ranganathan, M., & Manolopoulos, Y. (1994) · Proceedings of the 1994 ACM SIGMOD international conference on Management of data · doi:10.1145/191839.191925 · Cited by 1,709
Roussopoulos, N., Kelley, S., & Vincent, F. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223794 · Cited by 1,402
(1974) · IEEE Acoustics, Speech, and Signal Processing Newsletter · doi:10.1109/msp.1974.237438 · Cited by 1,339
Jähne, B. (1991) · Springer eBooks · doi:10.1007/978-3-662-11565-7 · Cited by 1,222
Berchtold, S., Keim, D. A., & Kriegel, H.-P. (2002) · Readings in Multimedia Computing and Networking · doi:10.1016/b978-155860651-7/50124-8 · Cited by 1,118
Wavelets for computer graphics: a primer.1
Stollnitz, E. J., DeRose, A. D., & Salesin, D. H. (1995) · IEEE Computer Graphics and Applications · doi:10.1109/38.376616 · Cited by 727
The Analysis of Time Series: An Introduction
Chatfield, C. (1984) · Springer eBooks · doi:10.1007/978-1-4899-2921-1 · Cited by 516
Efficiently supporting ad hoc queries in large datasets of time sequences
Korn, F., Jagadish, H. V., & Faloutsos, C. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253332 · Cited by 405
WAVELETS: MATHEMATICS AND APPLICATIONSPreprint
Dremin, I. (2004) · Cited by 401
Similarity-based queries for time series data
Rafiei, D., & Mendelzon, A. O. (1997) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/253260.253264 · Cited by 378
Schroder, P. (1996) · Proceedings of the IEEE · doi:10.1109/5.488703 · Cited by 241
Efficient retrieval for browsing large image databases
Wu, D. D., Singh, A. K., Agrawal, D., Abbadi, A. E., & Smith, T. R. (1996) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/238355.238365 · Cited by 81
Cited by
Time-series clustering – A decade review
Aghabozorgi, S., Seyed Shirkhorshidi, A., & Ying Wah, T. (2015) · Information Systems · doi:10.1016/j.is.2015.04.007 · Cited by 1,826
A symbolic representation of time series, with implications for streaming algorithms
Lin, J., Keogh, E., Lonardi, S., & Chiu, B. (2003) · Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery · doi:10.1145/882082.882086 · Cited by 1,799
Experiencing SAX: A novel symbolic representation of time series
Lin, J., Keogh, E., Wei, L., & Lonardi, S. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-007-0064-z · Cited by 1,618
“Figure 1 illustrates a hierarchy of all the various time series representations in the literature (Andre-Jonsson and Badal 1997; Chan and Fu 1999; Faloutsos et al. 1994; Geurts 2001; Huang and Yu 1999; Keogh et al. 2001a; Keogh and Pazzani 1998; Roddick et al. 2001; Shahabi et al. 2000; Yi and…”
BackgroundMethodInfluentialDimensionality Reduction for Fast Similarity Search in Large Time Series Databases
Keogh, E., Chakrabarti, K., Pazzani, M., & Mehrotra, S. (2001) · Knowledge and Information Systems · doi:10.1007/pl00011669 · Cited by 1,573
A review on time series data mining
Fu, T.-C. (2011) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2010.09.007 · Cited by 1,500
Metadata
- Authors
- Chan, K.-P., & Fu, A. W.-C.
- Venue
- Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)
- Publisher
- IEEE
- Published
- 1999
- Pages
- 126-133
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2042591571
- Cited by
- 1,031
- References
- 23
- FWCI
- 20.36
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.