Kmeans clustering how it works

>> YOUR LINK HERE: ___ http://youtube.com/watch?v=_aWzGGNrcic

Full lecture: http://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.

#############################

New on site