171,061 views 136 on YTPak
1,163 21

Published on 20 Jan 2014 | over 3 years ago

Full lecture: bit.ly/K-means
The K-means algorithm starts by placing K points (centroids) at random locations in space. We then perform the following steps iteratively: (1) for each instance, we assign it to a cluster with the nearest centroid, and (2) we move each centroid to the mean of the instances assigned to it. The algorithm continues until no instances change cluster membership.

Loading related videos...