Efficient Tracking of the Dominant Eigenspace of a Normalized Kernel Matrix

DOI10.1162/NECO.2007.05-06-213MaRDI QIDQ5446248zbMATH OpenOpenAlexWikidataFDO

Authors Geert Gins, Ilse Y. Smets, Jan van Impe

Publication date 6 March 2008

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/212385

zbMATH Keywords

kernel-based methodsmachine learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Efficiently updating and tracking the dominant normalized kernel principal components
• Efficiently updating and tracking the dominant kernel principal components
• A fast algorithm for updating and downsizing the dominant kernel principal components
• scientific article; zbMATH DE number 2147268
• On the Nyström method for approximating a gram matrix for improved kernel-based learning

Cites work

• An Expectation-Maximization Approach to Nonlinear Component Analysis
• Efficiently updating and tracking the dominant kernel principal components

Cited in

(4)

• A fast algorithm for updating and downsizing the dominant kernel principal components
• Efficiently updating and tracking the dominant normalized kernel principal components
• Updating kernel methods in spectral decomposition by affinity perturbations
• Efficiently updating and tracking the dominant kernel principal components

This page was built for publication: Efficient Tracking of the Dominant Eigenspace of a Normalized Kernel Matrix

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