350 search results - page 1 / 70 » Semidefinite spectral clustering |
CVPR
2007
IEEE
14 years 6 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
PR
2006
13 years 4 months ago
2006
PAKDD
2004
ACM
13 years 10 months ago
2004
ACM
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...
CVPR
2009
IEEE
14 years 11 months ago
2009
IEEE
We propose a novel framework for constrained spectral
clustering with pairwise constraints which specify whether
two objects belong to the same cluster or not. Unlike previous
m...
NIPS
2004
13 years 6 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...