pith. sign in

arxiv: 1609.08569 · v1 · pith:VG6UIKNEnew · submitted 2016-09-27 · 📊 stat.CO

The Hierarchical Spectral Merger algorithm: A New Time Series Clustering Procedure

classification 📊 stat.CO
keywords seriesspectraltimemethodalgorithmclusteringclustersdata
0
0 comments X
read the original abstract

We present a new method for time series clustering which we call the Hierarchical Spectral Merger (HSM) method. This procedure is based on the spectral theory of time series and identifies series that share similar oscillations or waveforms. The extent of similarity between a pair of time series is measured using the total variation distance between their estimated spectral densities. At each step of the algorithm, every time two clusters merge, a new spectral density is estimated using the whole information present in both clusters, which is representative of all the series in the new cluster. The method is implemented in an R package HSMClust. We present two applications of the HSM method, one to data coming from wave-height measurements in oceanography and the other to electroencefalogram (EEG) data.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.