On the clustering behavior of sliding windows

Clustering is one of the most common tasks in data science, and given the ubiquity of timeseries data, one is naturally inclined to cluster it. In order to perform Euclidean clustering (such as k-means clustering) on timeseries data, one must first map the data into Euclidean space. This is traditionally accomplished with a sliding window.