Approximations to Magic: Finding Unusual Medical Time Series
- 27 July 2005
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 329-334
- https://doi.org/10.1109/cbms.2005.34
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.Keywords
This publication has 4 references indexed in Scilit:
- Towards parameter-free data miningPublished by Association for Computing Machinery (ACM) ,2004
- Probabilistic discovery of time series motifsPublished by Association for Computing Machinery (ACM) ,2003
- A symbolic representation of time series, with implications for streaming algorithmsPublished by Association for Computing Machinery (ACM) ,2003
- On the need for time series data mining benchmarksPublished by Association for Computing Machinery (ACM) ,2002