Updating kernel methods in spectral decomposition by affinity perturbations
From MaRDI portal
Recommendations
- Efficiently updating and tracking the dominant kernel principal components
- Incremental spectral clustering by efficiently updating the eigen-system
- Efficiently updating and tracking the dominant normalized kernel principal components
- A fast algorithm for updating and downsizing the dominant kernel principal components
- Efficient Tracking of the Dominant Eigenspace of a Normalized Kernel Matrix
Cites work
- A randomized algorithm for the decomposition of matrices
- A Survey of Eigenvector Methods for Web Information Retrieval
- Adaptive methods for the computation of PageRank
- Derivatives and Perturbations of Eigenvectors
- Diffusion maps
- Geometric harmonics: a novel tool for multiscale out-of-sample extension of empirical functions
- Hierarchical data organization, clustering and denoising via localized diffusion folders
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Multiscale data sampling and function extension
- Updating Markov Chains with an Eye on Google's PageRank
Cited in
(5)- Clustering based on eigenvectors of the adjacency matrix
- scientific article; zbMATH DE number 2062634 (Why is no real title available?)
- Mathematical analysis on out-of-sample extensions
- Incremental spectral clustering by efficiently updating the eigen-system
- Efficiently updating and tracking the dominant kernel principal components
This page was built for publication: Updating kernel methods in spectral decomposition by affinity perturbations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442667)
