Add link to show k-means (#25732)
Link gives an interactive visualization of how the k-means algorithm works.
This commit is contained in:
		| @@ -99,6 +99,8 @@ plt.show() | ||||
|  | ||||
| Since the data points belong usually to a high-dimensional space, the similarity measure is often defined as a distance between two vectors (Euclidean, Manhathan, Cosine, Mahalanobis...) | ||||
|  | ||||
| Here's a visualization of K-means that allows you to change the number of clusters and centroids to show how k data points converge into clusters around the closest centroid: [Visualizing K-Means](http://stanford.edu/class/ee103/visualizations/kmeans/kmeans.html) | ||||
|  | ||||
| ### Mixture Density | ||||
| We can write *mixture density* as: | ||||
|  | ||||
|   | ||||
		Reference in New Issue
	
	Block a user