Approximations to Magic: Finding Unusual Medical Time Series
The DOI matches its Crossref record.
Abstract
In this work we introduce the new problem of finding time series discords. Time series discords are subsequences of longer time series that are maximally different to all the rest of the time series subsequences. They thus capture the sense of the most unusual subsequence within a time series. While the brute force algorithm to discover time series discords is quadratic in the length of the time series, we show a simple algorithm that is 3 to 4 orders of magnitude faster than brute force, while guaranteed to produce identical results.
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
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
“Collective anomaly detection techniques have been applied to detect anomalies in such data [Lin et al. 2005].”
MethodA survey of network anomaly detection techniques
Ahmed, M., Naser Mahmood, A., & Hu, J. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2015.11.016 · Cited by 1,750
Pimentel, M. A. F., Clifton, D. A., Clifton, L., & Tarassenko, L. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.12.026 · Cited by 1,649
A Review on Outlier/Anomaly Detection in Time Series Data
Blázquez-García, A., Conde, A., Mori, U., & Lozano, J. A. (2022) · ACM Computing Surveys · doi:10.1145/3444690 · Cited by 1,102
“…most straightforward idea consists of detecting the most unusual subsequence in a time series (denominated time series discord ) [Keogh et al. 2005; Lin et al. 2005], by comparing each subsequence with the others; that is, D where A is the set of all subsequences of X extracted by a sliding…”
BackgroundMethodA Comparative Evaluation of Unsupervised Anomaly Detection Algorithms for Multivariate Data
Goldstein, M., & Uchida, S. (2016) · PLOS ONE · doi:10.1371/journal.pone.0152173 · Cited by 1,032
Outlier 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
Musa, T. H. A., & Bouras, A. (2022) · Lecture Notes in Networks and Systems · doi:10.1007/978-981-16-2102-4_36 · Cited by 958
Anomaly Detection for Discrete Sequences: A Survey
Chandola, V., Banerjee, A., & Kumar, V. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.235 · Cited by 715
A survey of anomaly detection techniques in financial domain
Ahmed, M., Mahmood, A. N., & Islam, M. R. (2016) · Future Generation Computer Systems · doi:10.1016/j.future.2015.01.001 · Cited by 528
Enhancing one-class support vector machines for unsupervised anomaly detection
Amer, M., Goldstein, M., & Abdennadher, S. (2013) · Proceedings of the ACM SIGKDD Workshop on Outlier Detection and Description · doi:10.1145/2500853.2500857 · Cited by 427
A Review of Local Outlier Factor Algorithms for Outlier Detection in Big Data Streams
Alghushairy, O., Alsini, R., Soule, T., & Ma, X. (2020) · Big Data and Cognitive Computing · doi:10.3390/bdcc5010001 · Cited by 345
Time Warp Edit Distance with Stiffness Adjustment for Time Series Matching
Marteau, P.-F. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.76 · Cited by 335
Outlier Detection: Methods, Models, and Classification
Boukerche, A., Zheng, L., & Alfandi, O. (2021) · ACM Computing Surveys · doi:10.1145/3381028 · Cited by 334
Metadata
- Authors
- Lin, J., Keogh, E., Fu, A., & Van Herle, H.
- Venue
- 18th IEEE Symposium on Computer-Based Medical Systems (CBMS'05)
- Publisher
- IEEE
- Published
- 2005-07-27
- Pages
- 329-334
- ISSN
- 1063-7125 (ISSN-L)
- OpenAlex
- W2155490300
- Cited by
- 138
- References
- 0
- FWCI
- 1.60
- 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.