The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Haar wavelets for efficient similarity search of time-series: with and without time warping
Abstract
We address the handling of time series search based on two important distance definitions: Euclidean distance and time warping distance. The conventional method reduces the dimensionality by means of a discrete Fourier transform. We apply the Haar wavelet transform technique and propose the use of a proper normalization so that the method can guarantee no false dismissal for Euclidean distance. We found that this method has competitive performance from our experiments. Euclidean distance measurement cannot handle the time shifts of patterns. It fails to match the same rise and fall patterns of sequences with different scales. A distance measure that handles this problem is the time warping distance. However, the complexity of computing the time warping distance function is high. Also, as time warping distance is not a metric, most indexing techniques would not guarantee any false dismissal. We propose efficient strategies to mitigate the problems of time warping. We suggest a Haar wavelet-based approximation function for time warping distance, called Low Resolution Time Warping, which results in less computation by trading off a small amount of accuracy. We apply our approximation function to similarity search in time series databases, and show by experiment that it is highly effective in suppressing the number of false alarms in similarity search.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Fundamentals of speech recognition
Rabiner, L. R., & Juang, B.-H. F. (1993) · Cited by 7,680
Dynamic Programming Algorithm Optimization for Spoken Word Recognition
Sakoe, H., & Chiba, S. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163055 · Cited by 6,727
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
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
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
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
Mark, J. W. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9993 · Cited by 1,565
Gupta, R. P. (1991) · Remote Sensing Geology · doi:10.1007/978-3-662-12914-2_12 · Cited by 1,425
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
Efficient time series matching by wavelets
Chan, K.-P., & Fu, A. W.-C. (1999) · Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) · doi:10.1109/icde.1999.754915 · Cited by 1,031
Self-citationScaling up dynamic time warping for datamining applications
Keogh, E. J., & Pazzani, M. J. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347153 · Cited by 820
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
Fast subsequence matching in time-series databases
Faloutsos, C., Ranganathan, M., & Manolopoulos, Y. (1994) · ACM SIGMOD Record · doi:10.1145/191843.191925 · Cited by 722
Wavelets for computer graphics: theory and applications
Stollnitz, E. J., DeRose, T., & Salesin, D. (1996) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 696
Fast Time Sequence Indexing for Arbitrary Lp Norms
Yi, B.-K., & Faloutsos, C. (2018) · doi:10.1184/r1/6605618 · Cited by 650
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
Similarity-based queries for time series data
Rafiei, D., & Mendelzon, A. O. (1997) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/253260.253264 · Cited by 340
Sakoe, H. (1979) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1979.1163310 · Cited by 261
A level building dynamic time warping algorithm for connected word recognition
Myers, C., & Rabiner, L. (1981) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1981.1163527 · Cited by 261
Dimensionality reduction for similarity searching in dynamic databases
Ravi Kanth, K. V., Agrawal, D., & Singh, A. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276320 · Cited by 256
Schroder, P. (1996) · Proceedings of the IEEE · doi:10.1109/5.488703 · Cited by 241
WALRUS: a similarity retrieval algorithm for image databases
Natsev, A., Rastogi, R., & Shim, K. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1262183 · Cited by 159
Natsev, A., Rastogi, R. R., & Shim, K. (1999) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/304182.304217 · Cited by 77
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 71
Cited by
Exact indexing of dynamic time warping
Keogh, E., & Ratanamahatana, C. A. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-004-0154-9 · Cited by 1,962
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
Esling, P., & Agon, C. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379788 · Cited by 997
Patterns of temporal variation in online media
Yang, J., & Leskovec, J. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935863 · Cited by 986
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
Metadata
- Authors
- Chan, F. K., Fu, A. W.-C., & Yu, C.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2003-05
- Volume
- 15
- Issue
- 3
- Pages
- 686-705
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2107856142
- Cited by
- 261
- References
- 27
- FWCI
- 10.33
- Type
- journal article
- 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.