5096 search results - page 81 / 1020 » Landscape of Clustering Algorithms |
119
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
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 algori...
112
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper addresses the relationship between the Visual Assessment of cluster Tendency (VAT) algorithm and Dunn’s cluster validity index. We present an analytical comparison in...
139
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
124
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...
141
click to vote
EUSFLAT
2009
15 years 2 months ago
2009
Fuzzy C-Means (FCM) and hard clustering are the most common tools for data partitioning. However, the presence of noisy observations in the data may cause generation of completely ...