1775 search results - page 34 / 355 » Learning Spectral Clustering |
NIPS
2001
14 years 8 days ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
ICASSP
2009
IEEE
14 years 5 months ago
2009
IEEE
In this paper we investigate the use of data driven clustering methods for functional connectivity analysis in fMRI. In particular, we consider the K-Means and Spectral Clustering...
NIPS
2001
14 years 8 days ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
CVPR
2007
IEEE
15 years 27 days 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...
SEMCO
2009
IEEE
14 years 5 months ago
2009
IEEE