1420 search results - page 123 / 284 » Cluster Ensemble Selection |
100
Voted
NIPS
2003
15 years 2 months ago
2003
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
93
Voted
WILF
2009
Springer
15 years 7 months ago
2009
Springer
Measuring the similarity between clusterings is a classic problem with several proposed solutions. In this work we focus on measures based on coassociation of data pairs and perfor...
114
click to vote
CONCURRENCY
2000
15 years 18 days ago
2000
The contribution of this paper is twofold. First a distributed garbage collector (DGC) is presented that is optimized for remote method invocation in reliable networks, such as cu...
109
Voted
JMLR
2010
14 years 7 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...
103
click to vote
PAA
2006
15 years 21 days ago
2006
Abstract In this paper, an efficient K-medians clustering (unsupervised) algorithm for prototype selection and Supervised K-medians (SKM) classification technique for protein seque...