How to handle cyclical features, for distance methodologies like k-means machine learning algorithms
Often in situations of use machine learnings methods, we have to consider how to handle the cyclic features. For example in K-Means algorithm it use Euclidean distance in order to sort the available data’s in clusters. In this situations the distance between the hour 0 (00:00) from 23 (23:00) is bigger than what really is. …