56 search results - page 2 / 12 » Structural Similarity: Spectral Methods for Relaxed Blockmod... |
IPCO
2008
13 years 7 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
CVPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Spectral clustering is a simple yet powerful method for finding structure in data using spectral properties of an associated pairwise similarity matrix. This paper provides new in...
IPPS
2000
IEEE
13 years 10 months ago
2000
IEEE
Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph ...
CVPR
2010
IEEE
13 years 6 months ago
2010
IEEE
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
BMCBI
2006
13 years 6 months ago
2006
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...