News for hackers. Stuff that matters.
Re:Introduction to Mean Shift Algorithm by web007 on Friday September 02, 2016 @11:34AM (#12413718)
This sounds similar to k-means - pick some points "at random" and iteratively move them to the average location of all nearest neighbors until you stabilize. But mean shift goes in the opposite direction, giving each point a window and grouping them on overlaps. Can someone who understands both confirm this is the case, or correct my understanding?
Re:Introduction to Mean Shift Algorithm by RossBencina on Friday September 02, 2016 @12:05PM (#12413966)
The article includes a comparison with k-means. From the article, mean-shift:

> does not assume anything about number of clusters

> can handle arbitrarily shaped clusters

> is fairly robust to initializations

> not very sensitive to outliers

> time complexity mean-shift: O(Tn^2), k-means: O(knT). (k: number of clusters, n: number of points, T: number of iterations).

[Edit: formatting]