350 search results - page 37 / 70 » Semidefinite spectral clustering |
CVPR
2011
IEEE
14 years 1 months ago
2011
IEEE
Modeling data by multiple low-dimensional planes is an important problem in many applications such as computer vision and pattern recognition. In the most general setting where on...
107
click to vote
NIPS
2004
14 years 11 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
WACV
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, we present a novel solution of image segmentation based on positiveness by regarding the segmentation as one of the graph-theoretic clustering problems. On the cont...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper we show that many kernel methods can be adapted to deal with indefinite kernels, that is, kernels which are not positive semidefinite. They do not satisfy Mercer...
SIAMJO
2008
14 years 9 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....