Geodesic K-means clustering

@article{Asgharbeygi2008GeodesicKC,
  title={Geodesic K-means clustering},
  author={Nima Asgharbeygi and Arian Maleki},
  journal={2008 19th International Conference on Pattern Recognition},
  year={2008},
  pages={1-4}
}
We introduce a class of geodesic distances and extend the K-means clustering algorithm to employ this distance metric. Empirically, we demonstrate that our geodesic K-means algorithm exhibits several desirable characteristics missing in the classical K-means. These include adjusting to varying densities of clusters, high levels of resistance to outliers, and handling clusters that are not linearly separable. Furthermore our comparative experiments show that geodesic K-means comes very close to… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS