Time Series k-Means: A New k-Means Type Smooth Subspace Clustering for Time Series Data

Research paper by Xiaohui Huang, Yunming Ye, Liyan Xiong, Raymond Y.K. Lau, Nan Jiang, Shaokai Wang

Indexed on: 08 Jun '16Published on: 02 Jun '16Published in: Information Sciences


Existing clustering algorithms are weak in extracting smooth subspaces for clustering time series data. In this paper, we propose a new k-means type smooth subspace clustering algorithm named Time Series k-means (TSkmeans) for clustering time series data. The proposed TSkmeans algorithm can effectively exploit inherent subspace information of a time series data set to enhance clustering performance. More specifically, the smooth subspaces are represented by weighted time stamps which indicate the relative discriminative power of these time stamps for clustering objects. The main contributions of our work include the design of a new objective function to guide the clustering of time series data and the development of novel updating rules for iterative cluster searching with respect to smooth subspaces. Based on a synthetic data set and five real-life data sets, our experimental results confirm that the proposed TSkmeans algorithm outperforms other state-of-the-art time series clustering algorithms in terms of common performance metrics such as Accuracy, Fscore, RandIndex, and Normal Mutual Information.

Figure 10.1016/j.ins.2016.05.040.0.jpg
Figure 10.1016/j.ins.2016.05.040.1.jpg
Figure 10.1016/j.ins.2016.05.040.2.jpg
Figure 10.1016/j.ins.2016.05.040.3.jpg
Figure 10.1016/j.ins.2016.05.040.4.jpg
Figure 10.1016/j.ins.2016.05.040.5.jpg
Figure 10.1016/j.ins.2016.05.040.6.jpg
Figure 10.1016/j.ins.2016.05.040.7.jpg