23 search results - page 1 / 5 » Best of both: a hybridized centroid-medoid clustering heuris... |
ICML
2007
IEEE
14 years 7 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 ...
ALENEX
2008
13 years 8 months ago
2008
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
GECCO
2011
Springer
12 years 10 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
LCTRTS
2010
Springer
13 years 4 months ago
2010
Springer
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
KDD
2005
ACM
14 years 7 months ago
2005
ACM
We propose a hybrid, unsupervised document clustering approach that combines a hierarchical clustering algorithm with Expectation Maximization. We developed several heuristics to ...