1728 search results - page 39 / 346 » The Accelerated Euclidean Algorithm |
141
click to vote
ORL
1998
15 years 5 months ago
1998
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
148
click to vote
SDM
2010
SIAM
15 years 7 months ago
2010
SIAM
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
182
click to vote
ICDM
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we propose a semi-supervised framework for learning a weighted Euclidean subspace, where the best clustering can be achieved. Our approach capitalizes on user-const...
125
click to vote
NIPS
2003
15 years 7 months ago
2003
We describe a procedure which finds a hierarchical clustering by hillclimbing. The cost function we use is a hierarchical extension of the -means cost; our local moves are tree...
178
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in an...