Density-Weighted Nyström Method for Computing Large Kernel Eigensystems

DOI10.1162/NECO.2009.11-07-651MaRDI QIDQ3612109zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

Publication date 3 March 2009

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/neco.2009.11-07-651

zbMATH Keywords

probability density function

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Large-scale eigenvector approximation via Hilbert space embedding Nyström
• scientific article; zbMATH DE number 6276143
• On the Nyström method for approximating a gram matrix for improved kernel-based learning
• Fast spectral clustering via the Nyström method
• Large-scale SVD and manifold learning

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
• scientific article; zbMATH DE number 2062634 (Why is no real title available?)
• 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)