Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

Voted

ICPR
2008
IEEE

favoriteEmaildiscussreport

145views Computer Vision» more ICPR 2008»

Geodesic K-means clustering

15 years 11 days ago

Geodesic K-means clustering

Download www.stanford.edu

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 competing with state-of-the-art algorithms such as spectral and hierarchical clustering.

Arian Maleki, Nima Asgharbeygi

Real-time Traffic

Computer Vision | Geodesic K-means | ICPR 2008 | K-means Algorithm Exhibits | K-means Clustering Algorithm |

claim paper

Related Content

» Fast kMeans Algorithms with Constant Approximation

» kMeans Projective Clustering

» Methods of Decreasing the Number of Support Vectors via kMean Clustering

» Stability Yields a PTAS for kMedian and kMeans Clustering

» Fast Algorithms for Constant Approximation kMeans Clustering

» A novel unsupervised classification approach for network anomaly detection by kMeans clust...

» WorstCase and Smoothed Analysis of kMeans Clustering with Bregman Divergences

» Stability of k Means Clustering

» An Efficient kMeans Clustering Algorithm Analysis and Implementation

» The Effectiveness of LloydType Methods for the kMeans Problem

Post Info
More Details (n/a)

Added	05 Nov 2009
Updated	05 Nov 2009
Type	Conference
Year	2008
Where	ICPR
Authors	Arian Maleki, Nima Asgharbeygi

Comments (0)