The K-Spectral Centroid algorithm clusters time series by their shape, and finds the most representative shape (the cluster centroid) for each cluster. We provide the simple version of the K-SC code for Matlab. For brevity, this version does not include the Haar-Wavelet based incremental implemention discussed in the paper.
|test_ksc.m||Script that tests K-SC|
|ksc_toy.m||K-SC Matlab implementation code|
|ksc_toy.zip||K-SC Matlab Version|
Unpack the ksc code file in the directory with the data files, and run the following.