Continuous subspace clustering in streaming time series
- 作者：Maria Kontaki ; Apostolos N. Papadopoulos ; Yannis Manolopoulos
- 关键词：Continuous processing ; Subspace clustering ; Streaming time series ; Sliding window
- 刊名：Information Systems
- 出版年：2008
- 期刊代码：64_03064379
- 类别：cp
- 出版时间：April 2008
- 卷：33
- 期：2
- 页码：240-260
- 文件大小：447 K
摘要
Performing data mining tasks in streaming data is considered a challenging research direction, due to the continuous data evolution. In this work, we focus on the problem of clustering streaming time series, based on the sliding window paradigm. More specifically, we use the concept of subspace α-clusters. A subspace α-cluster consists of a set of streams, whose value difference is less than α in a consecutive number of time instances (dimensions). The clusters can be continuously and incrementally updated as the streaming time series evolve with time. The proposed technique is based on a careful examination of pair-wise stream similarities for a subset of dimensions and then it is generalized for more streams per cluster. Additionally, we extend our technique in order to find maximal pClusters in consecutive dimensions that have been used in previously proposed clustering methods. Performance evaluation results, based on real-life and synthetic data sets, show that the proposed method is more efficient than existing techniques. Moreover, it is shown that the proposed pruning criteria are very important for search space reduction, and that the cost of incremental cluster monitoring is more computationally efficient that the re-clustering process.