In this blog I will go a bit more in detail about the K-means method and explain how we can calculate the distance between centroid and data points to form a cluster. Consider the below data set which has the values of the data points on a particular graph. Table 1: We can randomly choose two initial points as the centroids and from there we can start calculating distance of each point. For now…
Most Popular Content on DSC
To not miss this type of content in the future, subscribe to our newsletter.
Articles from top bloggers
Other popular resources
Most popular articles