5 search results - page 1 / 1 » Hartigan's Method: k-means Clustering without Voronoi |
JMLR
2010
13 years 2 months ago
2010
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
WWW
2010
ACM
13 years 11 months ago
2010
ACM
This paper presents a technique for visualizing large spatial data sets in Web Mapping Systems (WMS). The technique creates a hierarchical clustering tree, which is subsequently u...
ESWA
2008
13 years 7 months ago
2008
Many methods have been developed to recognize those progresses of technologies, and one of them is to analyze patent information. And visualization methods are considered to be pr...
MICCAI
2009
Springer
14 years 8 months ago
2009
Springer
Determining cortical functional areas is an important goal for neurosciences and clinical neurosurgery. This paper presents a method for connectivity-based parcellation of the enti...