Finding Time Series Discord Based on Bit Representation Clustering

G. Li, O.M.P. Braysy, L. Jiang, Z. Wu, Y. Wang

Research output: Contribution to JournalArticleAcademicpeer-review


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. © 2013 Elsevier B.V. All rights reserved.
Original languageEnglish
Pages (from-to)243-254
JournalKnowledge-Based Systems
Publication statusPublished - 2013


Dive into the research topics of 'Finding Time Series Discord Based on Bit Representation Clustering'. Together they form a unique fingerprint.

Cite this