387 search results - page 4 / 78 » Beyond Pairwise Clustering |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
SDM
2004
SIAM
13 years 8 months ago
2004
SIAM
Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannotlink constra...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Pairwise constraints specify whether or not two samples should be in one cluster. Although it has been successful to incorporate them into traditional clustering methods, such as ...
IAT
2009
IEEE
14 years 2 months ago
2009
IEEE
—This paper proposes a method of learning a similarity matrix from pairwise constraints for interactive clustering. The similarity matrix can be learned by solving an optimizatio...