A fast algorithm for updating and downsizing the dominant kernel principal components
DOI10.1137/090774422zbMATH Open1209.65045OpenAlexW2139585442MaRDI QIDQ3079751FDOQ3079751
Paul van Dooren, Nicola Mastronardi, E. E. Tyrtyshnikov
Publication date: 2 March 2011
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090774422
Recommendations
- Efficiently updating and tracking the dominant kernel principal components
- Efficiently updating and tracking the dominant normalized kernel principal components
- Efficient Tracking of the Dominant Eigenspace of a Normalized Kernel Matrix
- Fast iterative kernel principal component analysis
- Adaptive kernel principal component analysis
algorithmsprincipal componentslow rank approximationmachine learningnumerical exampleseigenvectorsupdatingkernel Gram matrixdominant eigenvalueslarge scale data
Factor analysis and principal components; correspondence analysis (62H25) Learning and adaptive systems in artificial intelligence (68T05) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Linear equations (linear algebraic aspects) (15A06)
Cited In (5)
- An incremental singular value decomposition approach for large-scale spatially parallel \& distributed but temporally serial data -- applied to technical flows
- Recursive approximation of the dominant eigenspace of an indefinite matrix
- Efficient Tracking of the Dominant Eigenspace of a Normalized Kernel Matrix
- Efficiently updating and tracking the dominant kernel principal components
- Efficiently updating and tracking the dominant normalized kernel principal components
This page was built for publication: A fast algorithm for updating and downsizing the dominant kernel principal components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079751)
