4 ms·
The article includes a comparison with k-means. From the article, mean-shift: > does not assume anything about number of clusters > can handle arbitrarily sha
by RossBencina 10y ago
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]