Large-scale eigenvector approximation via Hilbert space embedding Nyström

DOI10.1016/J.PATCOG.2014.11.017MaRDI QIDQ1677860zbMATH OpenOpenAlexFDO

Authors Ming Lin, Fei Wang, Changshui Zhang

Publication date 13 November 2017

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2014.11.017

zbMATH Keywords

eigenfunctionseigenvaluesspectral analysissampling methods

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• Density-Weighted Nyström Method for Computing Large Kernel Eigensystems
• On the Nyström method for approximating a gram matrix for improved kernel-based learning
• Asymptotic error bounds for kernel-based Nyström low-rank approximation matrices
• Fast spectral clustering via the Nyström method
• Revisiting the Nyström method for improved large-scale machine learning

Cites work

• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• A Hilbert Space Embedding for Distributions
• Density-Weighted Nyström Method for Computing Large Kernel Eigensystems
• Hilbert space embeddings and metrics on probability measures
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Learning Eigenfunctions Links Spectral Embedding and Kernel PCA
• On the Nyström method for approximating a gram matrix for improved kernel-based learning
• The Spectral Approximation of Linear Operators with Applications to the Computation of Eigenelements of Differential and Integral Operators

Cited in

(2)

• Clustering based on eigenvectors of the adjacency matrix
• Density-Weighted Nyström Method for Computing Large Kernel Eigensystems

This page was built for publication: Large-scale eigenvector approximation via Hilbert space embedding Nyström

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677860)