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
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
Ding, H., Trajcevski, G., Scheuermann, P., Wang, X., & Keogh, E. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454226 · Cited by 1,354
Robust and fast similarity search for moving object trajectories
Chen, L., Özsu, M. T., & Oria, V. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066213 · Cited by 1,336
An online algorithm for segmenting time series
Keogh, E., Chu, S., Hart, D., & Pazzani, M. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989531 · Cited by 1,149
“Several high level representations of time series have been proposed, including Fourier Transforms [1] [13], Wavelets [4], Symbolic Mappings [2] [5] [24] and Piecewise Linear Representation (PLR).”
BackgroundEsling, P., & Agon, C. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379788 · Cited by 997
Locally adaptive dimensionality reduction for indexing large time series databases
Keogh, E., Chakrabarti, K., Pazzani, M., & Mehrotra, S. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375680 · Cited by 866
On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration
Keogh, E., & Kasetty, S. (2003) · Data Mining and Knowledge Discovery · doi:10.1023/a:1024988512476 · Cited by 861
Experimental comparison of representation methods and distance measures for time series data
Wang, X., Mueen, A., Ding, H., Trajcevski, G., Scheuermann, P., & Keogh, E. (2013) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-012-0250-5 · Cited by 845
On The Marriage of Lp-norms and Edit Distance
Chen, L., & Ng, R. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50070-x · Cited by 774
k-Shape: Efficient and Accurate Clustering of Time Series
Paparrizos, J., & Gravano, L. (2015) · Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2723372.2737793 · Cited by 680
Characteristic-Based Clustering for Time Series Data
Wang, X., Smith, K., & Hyndman, R. (2006) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-0039-x · Cited by 679
Zhu, Y., & Shasha, D. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50039-1 · Cited by 656
SEGMENTING TIME SERIES: A SURVEY AND NOVEL APPROACH
Keogh, E., Chu, S., Hart, D., & Pazzani, M. (2004) · Series in Machine Perception and Artificial Intelligence · doi:10.1142/9789812565402_0001 · Cited by 600
Probabilistic discovery of time series motifs
Chiu, B., Keogh, E., & Lonardi, S. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956808 · Cited by 573
Automated extraction and parameterization of motions in large data sets
Kovar, L., & Gleicher, M. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015760 · Cited by 483
On the need for time series data mining benchmarks: a survey and empirical demonstration
Keogh, E., & Kasetty, S. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775062 · Cited by 442
TSclust: An R Package for Time Series Clustering
Montero, P., & Vilar, J. A. (2014) · Journal of Statistical Software · doi:10.18637/jss.v062.i01 · Cited by 430
Making Time-series Classification More Accurate Using Learned Constraints
Ratanamahatana, C. A., & Keogh, E. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.2 · Cited by 407
Locally adaptive dimensionality reduction for indexing large time series databases
Chakrabarti, K., Keogh, E., Mehrotra, S., & Pazzani, M. (2002) · ACM Transactions on Database Systems · doi:10.1145/568518.568520 · Cited by 407
Sketch-based modeling: A survey
Olsen, L., Samavati, F. F., Sousa, M. C., & Jorge, J. A. (2009) · Computers & Graphics · doi:10.1016/j.cag.2008.09.013 · Cited by 381
Indexing spatio-temporal trajectories with Chebyshev polynomials
Cai, Y., & Ng, R. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007636 · Cited by 309
Landmarks: a new model for similarity-based pattern querying in time series databases
Perng, C.-S., Wang, H., Zhang, S. R., & Parker, D. S. (2002) · Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073) · doi:10.1109/icde.2000.839385 · Cited by 297
Rotation-invariant similarity in time series using bag-of-patterns representation
Lin, J., Khade, R., & Li, Y. (2012) · Journal of Intelligent Information Systems · doi:10.1007/s10844-012-0196-5 · Cited by 295
Similarity search over time-series data using wavelets
Popivanov, I., & Miller, R. J. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994711 · Cited by 280
A PCA-based similarity measure for multivariate time series
Yang, K., & Shahabi, C. (2004) · Proceedings of the 2nd ACM international workshop on Multimedia databases · doi:10.1145/1032604.1032616 · Cited by 276
Haar wavelets for efficient similarity search of time-series: with and without time warping
Chan, F. K., Fu, A. W.-C., & Yu, C. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1198399 · Cited by 261
Self-citationA comparison of DFT and DWT based similarity search in time-series databases
Wu, Y.-L., Agrawal, D., & El Abbadi, A. (2000) · Proceedings of the ninth international conference on Information and knowledge management · doi:10.1145/354756.354857 · Cited by 253
Discrete Wavelet transform-based time series analysis and mining
Chaovalit, P., Gangopadhyay, A., Karabatis, G., & Chen, Z. (2011) · ACM Computing Surveys · doi:10.1145/1883612.1883613 · Cited by 218
Large-Scale Image Clustering Based on Camera Fingerprints
Lin, X., & Li, C.-T. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2636086 · Cited by 46
Deep Unsupervised Binary Coding Networks for Multivariate Time Series Retrieval
Zhu, D., Song, D., Chen, Y., Lumezanu, C., Cheng, W., Zong, B., Ni, J., Mizoguchi, T., Yang, T., & Chen, H. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i02.5497 · Cited by 20
Ordonez, P., Armstrong, T., Oates, T., & Fackler, J. (2011) · 2011 10th International Conference on Machine Learning and Applications and Workshops · doi:10.1109/icmla.2011.46 · Cited by 8
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.