Density-Weighted Nyström Method for Computing Large Kernel Eigensystems
From MaRDI portal
Recommendations
Cited in
(7)- Iterative ensemble normalized cuts
- Large-scale eigenvector approximation via Hilbert space embedding Nyström
- On landmark selection and sampling in high-dimensional data analysis
- Fast density-weighted low-rank approximation spectral clustering
- Spectral partitioning with indefinite kernels using the Nyström extension
- Robust MST-based clustering algorithm
- Sparsity preserving projections with applications to face recognition
This page was built for publication: Density-Weighted Nyström Method for Computing Large Kernel Eigensystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612109)