Sciweavers

3 search results - page 1 / 1
» HOT SAX: Efficiently Finding the Most Unusual Time Series Su...
Sort
View
ICDM
2005
IEEE
271views Data Mining» more  ICDM 2005»
13 years 10 months ago
HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence
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...
Eamonn J. Keogh, Jessica Lin, Ada Wai-Chee Fu
KAIS
2007
117views more  KAIS 2007»
13 years 4 months ago
Finding the most unusual time series subsequence: algorithms and applications
Eamonn J. Keogh, Jessica Lin, Sang-Hee Lee, Helga ...
CBMS
2005
IEEE
13 years 10 months ago
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...
Jessica Lin, Eamonn J. Keogh, Ada Wai-Chee Fu, Hel...