HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Data Mining and Knowledge Discovery
SAXually Explicit Images: Finding Unusual Shapes
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Segmental Hidden Markov Models with Random Effects for Waveform Modeling
The Journal of Machine Learning Research
iSAX: indexing and mining terabyte sized time series
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Disk Aware Discord Discovery: Finding Unusual Time Series in Terabyte Sized Datasets
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
FSMBO: Fast Time Series Similarity Matching Based on Bit Operation
ICYCS '08 Proceedings of the 2008 The 9th International Conference for Young Computer Scientists
Heartbeat time series classification with support vector machines
IEEE Transactions on Information Technology in Biomedicine - Special section on biomedical informatics
Syntactic recognition of ECG signals by attributed finite automata
Pattern Recognition
Piecewise cloud approximation for time series mining
Knowledge-Based Systems
SwiftRule: Mining Comprehensible Classification Rules for Time Series Analysis
IEEE Transactions on Knowledge and Data Engineering
The Journal of Machine Learning Research
Finding time series discords based on haar transform
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
A novel bit level time series representation with implication of similarity search and clustering
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Experimental comparison of representation methods and distance measures for time series data
Data Mining and Knowledge Discovery
Artificial Intelligence in Medicine
Hi-index | 0.00 |
The problem of finding time series discord has attracted much attention recently due to its numerous applications and several algorithms have been suggested. However, most of them suffer from high computation cost and cannot satisfy the requirement of real applications. In this paper, we propose a novel discord discovery algorithm BitClusterDiscord which is based on bit representation clustering. Firstly, we use PAA (Piecewise Aggregate Approximation) bit serialization to segment time series, so as to capture the main variation characteristic of time series and avoid the influence of noise. Secondly, we present an improved K-Medoids clustering algorithm to merge several patterns with similar variation behaviors into a common cluster. Finally, based on bit representation clustering, we design two pruning strategies and propose an effective algorithm for time series discord discovery. Extensive experiments have demonstrated that the proposed approach can not only effectively find discord of time series, but also greatly improve the computational efficiency.