K-means clustering algorithm has been improved and de-bugged significantly. It is now capable of recognizing optimal k values! While sometimes it is a reasonable value of k=3 for the set1set5, win=500 data set I'm working with, sometimes it is unreasonable large, e.g. 9+. There is likely still tweaking to be done to ensure more accurate calling of k values. The downstream HMM portion of the program is still somewhat bugged from the conversion from Poisson-based states to cluster-based states, but should not require much effort to fix.