152 search results - page 2 / 31 » Finding Consistent Clusters in Data Partitions |
NIPS
2008
13 years 6 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
PRIS
2004
13 years 6 months ago
2004
We address the problem of the combination of multiple data partitions, that we call a clustering ensemble. We use a recent clustering approach, known as Spectral Clustering, and th...
CIDU
2010
13 years 2 months ago
2010
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
JMLR
2010
12 years 12 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...
CVPR
2003
IEEE
14 years 7 months ago
2003
IEEE
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an ...