Approximations to magic: Finding unusual medical time series
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.
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.
[PDF][PDF] Approximations to Magic: Finding Unusual Medical Time Series
JLEKA Fu, H Van Herle - cse.cuhk.edu.hk
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.
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.
以上显示的是最相近的搜索结果。 查看全部搜索结果