21 search results - page 1 / 5 » Finding the most unusual time series subsequence: algorithms... |
KAIS
2007
13 years 4 months ago
2007
ICDM
2005
IEEE
13 years 10 months ago
2005
IEEE
In this work, we introduce the new problem of finding time series discords. Time series discords are subsequences of a longer time series that are maximally different to all the r...
CBMS
2005
IEEE
13 years 10 months ago
2005
IEEE
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...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
The problem of finding unusual time series has recently attracted much attention, and several promising methods are now in the literature. However, virtually all proposed methods...
KDD
2012
ACM
11 years 7 months ago
2012
ACM
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...