𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Residual bilinearization. Part 1: Theory and algorithms

✍ Scribed by Jerker Öhman; Paul Geladi; Svante Wold

Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
634 KB
Volume
4
Category
Article
ISSN
0886-9383

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interactive variable selection (IVS) for
Interactive variable selection (IVS) for PLS. Part 1: Theory and algorithms
✍ Fredrick Lindgren; Paul Geladi; Stefan Rännar; Svante Wold 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 972 KB

A modified PLS algorithm is introduced with the goal of achieving improved prediction ability. The method, denoted IVS-PLS, is based on dimension-wise selective reweighting of single elements in the PLS weight vector w. Cross-validation, a criterion for the estimation of predictive quality, is used

The kernel PCA algorithms for wide data.
The kernel PCA algorithms for wide data. Part I: Theory and algorithms
✍ W. Wu; D.L. Massart; S. de Jong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 590 KB

Four classic PCA algorithms: NIPALS, the power method (POWER), singular value decomposition (SVD) and eigenvalue decomposition (EVD) are modified into their kernel version to analyse wide data sets. For such data sets with many variables and fewer objects, the classic algorithms become very ineffici