6 search results - page 1 / 2 » Block-quantized kernel matrix for fast spectral embedding |
ICML
2006
IEEE
14 years 5 months ago
2006
IEEE
ECML
2006
Springer
13 years 8 months ago
2006
Springer
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
GD
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
IJCAI
2003
13 years 6 months ago
2003
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...
NIPS
2004
13 years 6 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...