Experiencing SAX: a novel symbolic representation of time series
The DOI matches its Crossref record; 65 of the 66 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Yet, discrete representations—that are on par with contemporary continuous representations—can be crucial for tasks such as activity/routine discovery via characteristic actions [24], discovering multi-variate motifs from sensor data [25], dimensionality reduction [20], and performing interpretable time-series classification [26], since these techniques require time-series simplification as they w”
From Towards Learning Discrete Representations via Self-Supervision for Wearables-Based Human Activity Recognition (2024) · cites this paper as [20]
Citations
Cites
Biological sequence analysis probabilistic models of proteins and nucleic acids
Durbin, R. M., Eddy, S. R., Krogh, A., & Mitchison, G. (1998) · Cited by 3,565
Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids
Durbin, R., Eddy, S. R., Krogh, A., & Mitchison, G. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511790492 · Cited by 3,246 · cited 4×
“There is an enormous wealth of useful definitions, algorithms and data structures in the bioinformatics literature that can be exploited by our representation (Apostolico et al. 2002; Durbin et al. 1998; Gionis and Mannila 2003; Lonardi et al. 2001; Reinert et al. 2000; Staden et al. 1989; Tompa and Buhler 2001).”
BackgroundInfluential(1994) · Knowledge Discovery and Data Mining · Cited by 3,137
Gralton, B. (2008) · Art monthly Australia · Cited by 3,001
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 · cited 2×
“2 A preliminary version of this paper appears in [41].”
BackgroundSelf-citationFast 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
Dimensionality 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 · cited 14×
“The review below is necessarily brief; we refer interested readers to (Keogh and Kasetty 2002; Roddick et al. 2001) for a more in depth review.”
BackgroundMethodInfluentialSelf-citationDiscovering similar multidimensional trajectories
Vlachos, M., Kollios, G., & Gunopulos, D. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994784 · Cited by 1,468 · cited 1×
“Finally, there may be utility in extending our work to multidimensional and streaming time series (Vlachos et al. 2002).”
BackgroundAn Introduction to Mathematical Statistics and its Applications.
Skarpness, B., Larsen, R. J., & Marx, M. L. (1983) · Journal of the American Statistical Association · doi:10.2307/2287143 · Cited by 1,149
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 · cited 14×
“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…”
BackgroundMethodInfluential
Research works printed but not linked: 7
- Celly B, Zordan VB (2004) Animated people textures. In: Proceedings of the 17th international conference on computer animation and social agents, Geneva, Switzerland, July 7–9
- Dasgupta D, Forrest S (1999) Novelty detection in time series data using ideas from immunology. In: Proceedings of the 8th International conference on intelligent systems, Denver, CO, June 24–26
- Duchene F, Garbay C (2005) Apprentissage de Motifs Temporels, Multidimensionnels et Heterogenes: Application a la Telesurveillance Medicale. In: Proceedings of conference francophone sur l’apprentissage Automatique. Nice, France. May 31–June 3
- McGovern A, Kruger A, Rosendahl D, Droegemeier K (2006) Open problem: dynamic relational models for improved hazardous weather prediction. In: Proceedings of ICML workshop on open problems in statistical relational learning, Pittsburgh, PA, June 29
- Pouget F, Urvoy-Keller G, Dacier M (2006) Time signature to detect multi-headed stealthy attack tools. In: Proceedings of the 18th annual first conference, Baltimore, MD, June 25–30
- Silvent A, Carbay C, Carry, PY, Dojat M (2003) Data information and knowledge for medical scenario construction. In: Proceedings of the intelligent data analysis in medicine and pharmacology workshop, Protaras, Cyprus, October 19–22
- Tanaka Y, Uehara K (2004) Motif discovery algorithm from motion data. In: Proceedings of the 18th annual conference of the japanese society for artificial intelligence, Kanazawa, Japan, June 2–4
Cited by
Time series classification from scratch with deep neural networks: A strong baseline
Wang, Z., Yan, W., & Oates, T. (2017) · 2017 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2017.7966039 · Cited by 2,299
“Commonly, these features are quantized to form a Bag-ofWords (BoW), then given to the classifiers [2].”
BackgroundTime-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
“Some of similarity measures are proposed based on a specific time-series representations, for example, MINDIST which is compatible with SAX [84], and some of them work regardless of representation methods, or are compatible with raw time-series.”
BackgroundMethodInfluentialA 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
LSTM Fully Convolutional Networks for Time Series Classification
Karim, F., Majumdar, S., Darabi, H., & Chen, S. (2018) · IEEE Access · doi:10.1109/access.2017.2779939 · Cited by 1,465
“Bag-of-Words (BoW) [2], Bag-of-features (TSBF) [3], Bag-of-SFA-Symbols (BOSS) [4], BOSSVS [5], Word ExtrAction for time Series cLassification (WEASEL) [6], have obtained promising results in the field.”
BackgroundDing, H., Trajcevski, G., Scheuermann, P., Wang, X., & Keogh, E. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454226 · Cited by 1,354
“In contrast, in Figure 5 we can see that highly periodic data can slightly favor the spectral representations (DCT, DFT, CHEB) over the polynomial representations (SAX, APCA, DWT/PAA, IPLA).”
BackgroundInfluentialSelf-citation
Metadata
- Authors
- Lin, J., Keogh, E., Wei, L., & Lonardi, S.
- Affiliations
- George Mason University (US)
- University of California, Riverside (US)
- Corresponding author
- Lin, Jessica
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2007-04-03
- Volume
- 15
- Issue
- 2
- Pages
- 107-144
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2164274563
- Cited by
- 1,618
- References
- 66
- Citations by year
- 2026: 47 · 2025: 72 · 2024: 97 · 2023: 111 · 2022: 107 · 2021: 152 · 2020: 149 · 2019: 130 · 2018: 119 · 2017: 108 · 2016: 106 · 2015: 103 · 2014: 86 · 2013: 58 · 2012: 60
- FWCI
- 35.33
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Data Mining and Knowledge Discovery (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Time Series Analysis and Forecasting
- Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Clustering Algorithms Research
- Keywords
- SAX, time series data mining, dimensionality reduction, distance measures, clustering, classification, query by content, anomaly detection, motif discovery, time series visualization
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Experiencing SAX: a novel symbolic representation of time series. https://app.cochat.ai/papers/10.1007/s10618-007-0064-z
- The paper
- Lin, J., Keogh, E., Wei, L., & Lonardi, S. (2007). Experiencing SAX: a novel symbolic representation of time series. Data Mining and Knowledge Discovery. https://doi.org/10.1007/s10618-007-0064-z
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.