𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The kernel algorithm for PLS

✍ Scribed by Fredrik Lindgren; Paul Geladi; Svante Wold

Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
833 KB
Volume
7
Category
Article
ISSN
0886-9383

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Comments on the PLS kernel algorithm
Comments on the PLS kernel algorithm
✍ Sijmen De Jong; Cajo J. F. Ter Braak πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 355 KB

Lindgren et al. ( J . Chemometrics, 7 , 45-59 (1993)) published a so-called kernel algorithm for PLS regression of Y against X when the number of objects is very large. The algorithm is based solely on deflation of the cross-product matrices XTX, YTY and XTY. The algorithm is now described in a shor

A theoretical foundation for the PLS alg
A theoretical foundation for the PLS algorithm
✍ Avraham Lorber; Lawrence E. Wangen; Bruce R. Kowalski πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 831 KB
Toward the kernel of the vector epsilon
Toward the kernel of the vector epsilon algorithm
✍ John A. Steele; Allan T. Dolovich πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 98 KB

The vector epsilon algorithm (VEA) is a non-linear sequence-to-sequence transformation which has been in use for over 35 years to determine the limits (antilimits) of convergent (divergent) vector sequences. Recently, it has been used in a variety of engineering applications to accelerate iterative

Cross fitted partial least squares (CF-P
Cross fitted partial least squares (CF-PLS): an alternative algorithm for a more reliable PLS
✍ Olivier Cloarec πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 559 KB

## Abstract This paper presents a modified version of the NIPALS algorithm for PLS regression with one single response variable. This version, denoted a CF‐PLS, provides significant advantages over the standard PLS. First of all, it strongly reduces the over‐fit of the regression. Secondly, __R__^2