HOT SAX: efficiently finding the most unusual time series subsequence
暂无分享,去创建一个
[1] Eamonn J. Keogh,et al. On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration , 2002, Data Mining and Knowledge Discovery.
[2] Eamonn J. Keogh,et al. Towards parameter-free data mining , 2004, KDD.
[3] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[4] Raymond T. Ng,et al. Distance-based outliers: algorithms and applications , 2000, The VLDB Journal.
[5] Eamonn J. Keogh,et al. Probabilistic discovery of time series motifs , 2003, KDD '03.
[6] Jessica Lin,et al. Visually mining and monitoring massive time series , 2004, KDD.
[7] Kunihiko Sadakane,et al. Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array , 2000, ISAAC.
[8] Nitin Kumar,et al. Time-series Bitmaps: a Practical Visualization Tool for Working with Large Time Series Databases , 2005, SDM.
[9] Robert Sedgewick,et al. Fast algorithms for sorting and searching strings , 1997, SODA '97.
[10] Bin Ma,et al. Distinguishing string selection problems , 2003, SODA '99.
[11] Eamonn J. Keogh,et al. A symbolic representation of time series, with implications for streaming algorithms , 2003, DMKD '03.