Discord Discovery in Streaming Time Series based on an Improved HOT SAX Algorithm
暂无分享,去创建一个
[1] Zongda Wu,et al. Finding time series discord based on bit representation clustering , 2013, Knowl. Based Syst..
[2] Benjamin Bustos,et al. Anomaly Detection in Streaming Time Series Based on Bounding Boxes , 2014, SISAP.
[3] He Zengyou,et al. Squeezer: an efficient algorithm for clustering categorical data , 2002 .
[4] Eamonn J. Keogh,et al. Matrix Profile I: All Pairs Similarity Joins for Time Series: A Unifying View That Includes Motifs, Discords and Shapelets , 2016, 2016 IEEE 16th International Conference on Data Mining (ICDM).
[5] Duong Tuan Anh,et al. From Cluster-Based Outlier Detection to Time Series Discord Discovery , 2015, PAKDD Workshops.
[6] John A. Hartigan,et al. Clustering Algorithms , 1975 .
[7] Eamonn J. Keogh,et al. HOT SAX: efficiently finding the most unusual time series subsequence , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).
[8] Duong Tuan Anh,et al. Detecting Variable Length Anomaly Patterns in Time Series Data , 2016, DMBD.
[9] Eamonn J. Keogh,et al. A symbolic representation of time series, with implications for streaming algorithms , 2003, DMKD '03.
[10] Jian Pei,et al. WAT: Finding Top-K Discords in Time Series Database , 2007, SDM.
[11] Fei Wang,et al. Efficient Detection of Discords for Time Series Stream , 2009, APWeb/WAIM.