The DOI matches its OpenAlex record.
A symbolic representation of time series, with implications for streaming algorithms
Abstract
The parallel explosions of interest in streaming data, and data mining of time series have had surprisingly little intersection. This is in spite of the fact that time series data are typically streaming data. The main reason for this apparent paradox is the fact that the vast majority of work on streaming data explicitly assumes that the data is discrete, whereas the vast majority of time series data is real valued.Many researchers have also considered transforming real valued time series into symbolic representations, nothing that such representations would potentially allow researchers to avail of the wealth of data structures and algorithms from the text processing and bioinformatics communities, in addition to allowing formerly "batch-only" problems to be tackled by the streaming community. While many symbolic representations of time series have been introduced over the past decades, they all suffer from three fatal flaws. Firstly, the dimensionality of the symbolic representation is the same as the original data, and virtually all data mining algorithms scale poorly with dimensionality. Secondly, although distance measures can be defined on the symbolic approaches, these distance measures have little correlation with distance measures defined on the original time series. Finally, most of these symbolic approaches require one to have access to all the data, before creating the symbolic representation. This last feature explicitly thwarts efforts to use the representations with streaming algorithms.In this work we introduce a new symbolic representation of time series. Our representation is unique in that it allows dimensionality/numerosity reduction, and it also allows distance measures to be defined on the symbolic approach that lower bound corresponding distance measures defined on the original series. As we shall demonstrate, this latter feature is particularly exciting because it allows one to run certain data mining algorithms on the efficiently manipulated symbolic representation, while producing identical results to the algorithms that operate on the original data. Finally, our representation allows the real valued data to be converted in a streaming fashion, with only an infinitesimal time and space overhead.We will demonstrate the utility of our representation on the classic data mining tasks of clustering, classification, query by content and anomaly detection.
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
Cited by
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
Self-citationOutlier Detection for Temporal Data: A Survey
Gupta, M., Gao, J., Aggarwal, C. C., & Han, J. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.184 · Cited by 1,001
k-Nearest Neighbour Classifiers - A Tutorial
Cunningham, P., & Delany, S. J. (2022) · ACM Computing Surveys · doi:10.1145/3459665 · Cited by 942
HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence
Keogh, E., Lin, J., & Fu, A. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.79 · Cited by 696
Self-citationEvaluating Real-Time Anomaly Detection Algorithms -- The Numenta Anomaly Benchmark
Lavin, A., & Ahmad, S. (2015) · 2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA) · doi:10.1109/icmla.2015.141 · Cited by 457
A deep learning approach to on-node sensor data analytics for mobile or wearable devices
Ravi, D., Wong, C., Lo, B., & Yang, G.-Z. (2017) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2016.2633287 · Cited by 439
LSTM-Based EEG Classification in Motor Imagery Tasks
Wang, P., Jiang, A., Liu, X., Shang, J., & Zhang, L. (2018) · IEEE Transactions on Neural Systems and Rehabilitation Engineering · doi:10.1109/tnsre.2018.2876129 · Cited by 358
Clustering of Electricity Consumption Behavior Dynamics Toward Big Data Applications
Wang, Y., Chen, Q., Kang, C., & Xia, Q. (2016) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2548565 · Cited by 342
Visual Methods for Analyzing Time-Oriented Data
Aigner, W., Miksch, S., Muller, W., Schumann, H., & Tominski, C. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.70415 · Cited by 284
Ravi, D., Wong, C., Lo, B., & Yang, G.-Z. (2016) · 2016 IEEE 13th International Conference on Wearable and Implantable Body Sensor Networks (BSN) · doi:10.1109/bsn.2016.7516235 · Cited by 269
Discovering Characteristic Actions from On-Body Sensor Data
Minnen, D., Starner, T., Essa, I., & Isbell, C. (2006) · 2006 10th IEEE International Symposium on Wearable Computers · doi:10.1109/iswc.2006.286337 · Cited by 132
Classification of Heart Diseases Based On ECG Signals Using Long Short-Term Memory
Liu, M., & Kim, Y. (2018) · 2018 40th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC) · doi:10.1109/embc.2018.8512761 · Cited by 83
Fekr, A. R., Radecka, K., & Zilic, Z. (2015) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2015.2445783 · Cited by 61
A Framework for Automatic Text Generation of Trends in Physiological Time Series Data
Banaee, H., Ahmed, M. U., & Loutfi, A. (2013) · 2013 IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc.2013.661 · Cited by 21
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
- Lin, J., Keogh, E., Lonardi, S., & Chiu, B.
- Published
- 2003-01-01
- OpenAlex
- W4242702158
- Cited by
- 642
- References
- 0
- FWCI
- 9.43
- 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.