𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A theoretical foundation for the PLS algorithm

✍ Scribed by Avraham Lorber; Lawrence E. Wangen; Bruce R. Kowalski

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
831 KB
Volume
1
Category
Article
ISSN
0886-9383

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The kernel algorithm for PLS
The kernel algorithm for PLS
✍ Fredrik Lindgren; Paul Geladi; Svante Wold πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 833 KB
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

A theoretical foundation for solving β€œno
A theoretical foundation for solving β€œno-solution” problems by abstraction
✍ Kiyoshi Akama; Hiroshi Mabuchi; Eiichi Miyamoto πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 305 KB

Complicated problems are often solved by simplification into more manageable abstract problems, the solution of which yields information about the original problem. The proposed theory lays a foundation for such a technique to solve no-solution problems in logic programming. The new theory is based