期刊
KNOWLEDGE-BASED SYSTEMS
卷 54, 期 -, 页码 243-254出版社
ELSEVIER
DOI: 10.1016/j.knosys.2013.09.015
关键词
Time series data mining; Discord discovery; Clustering; Pruning; Dimensionality reduction
资金
- National Natural Science Foundation of China [61202171]
- Program for New Century Excellent Talents in University [NCET-12-0953]
- Fundamental Research Funds for the Central Universities, China University of Geosciences (Wuhan) [CUGL120281]
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. (C) 2013 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据