333 search results - page 16 / 67 » B-Matching for Spectral Clustering |
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvecto...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
We propose a family of clustering algorithms based on the maximization of dependence between the input variables and their cluster labels, as expressed by the Hilbert-Schmidt Inde...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
NIPS
2004
13 years 9 months ago
2004
We study a number of open issues in spectral clustering: (i) Selecting the appropriate scale of analysis, (ii) Handling multi-scale data, (iii) Clustering with irregular backgroun...
IJCNN
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper a clustering algorithm that learns the groups of synchronized spike trains directly from data is proposed. Clustering of spike trains based on the presence of syn...