✦ LIBER ✦

A Fast Algorithm for Updating and Downsizing the Dominant Kernel Principal Components

✍ Scribed by Mastronardi, Nicola; Tyrtyshnikov, Eugene E.; Van Dooren, Paul

Book ID: 111692617
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 548 KB
Volume: 31
Category: Article
ISSN: 0895-4798
DOI: 10.1137/090774422

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficiently updating and tracking the do

Efficiently updating and tracking the dominant kernel principal components

✍ L. Hoegaerts; L. De Lathauwer; I. Goethals; J.A.K. Suykens; J. Vandewalle; B. De 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 731 KB

The dominant set of eigenvectors of the symmetrical kernel Gram matrix is used in many important kernel methods (like e.g. kernel Principal Component Analysis, feature approximation, denoising, compression, prediction) in the machine learning area. Yet in the case of dynamic and/or large-scale data,

Fast and stable algorithms for computing

Fast and stable algorithms for computing the principal nth root of a complex matrix and the matrix sector function

✍ J.S.H. Tsai; L.S. Shieh; R.E. Yates 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 595 KB