Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Introduction to Mean Shift Algorithm. Parent comment
> 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]
There are no comments on this comment yet.
> 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]