Sciweavers

62 search results - page 4 / 13
» Geodesic K-means clustering
Sort
View
ICONIP
2008
13 years 8 months ago
Comparison of Cluster Algorithms for the Analysis of Text Data Using Kolmogorov Complexity
In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kol...
Tina Geweniger, Frank-Michael Schleif, Alexander H...
ICASSP
2008
IEEE
14 years 1 months ago
Density geodesics for similarity clustering
We address the problem of similarity metric selection in pairwise affinity clustering. Traditional techniques employ standard algebraic context-independent sample-distance measur...
Umut Ozertem, Deniz Erdogmus, Miguel Á. Car...
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
14 years 23 days ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
ISAAC
2007
Springer
84views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Geodesic Disks and Clustering in a Simple Polygon
Magdalene G. Borgelt, Marc J. van Kreveld, Jun Luo
CVPR
2006
IEEE
14 years 9 months ago
The Bottleneck Geodesic: Computing Pixel Affinity
A meaningful affinity measure between pixels is essential for many computer vision and image processing applications. We propose an algorithm that works in the features' hist...
Ido Omer, Michael Werman