Probabilistic discovery of time series motifs
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Hi-index | 0.00 |
Time series clustering by k -Means algorithm still has to overcome the dilemma of choosing the initial cluster centers. In this paper, we present a new method for initializing the k -Means clustering algorithm of time series data. Our initialization method hinges on the use of time series motif information detected by a previous task in choosing k time series in the database to be the seeds. Experimental results show that our proposed clustering approach performs better than ordinary k -Means in terms of clustering quality, robustness and running time.