Recently, Bro published a paper on multilinear PLS (J. Chemometrics, 10, 47-61 (1996)) in which he proposed a generalization of PLS to multiway situations, called multilinear PLS, which is a mixture of a trilinear model (PARAFAC) and PLS. However, Bro does not give the equations for the prediction s
Comments on the PLS kernel algorithm
β Scribed by Sijmen De Jong; Cajo J. F. Ter Braak
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 355 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0886-9383
No coin nor oath required. For personal study only.
β¦ Synopsis
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 shorter and more transparent way and compared with a similar algorithm for the singular value decomposition of XTY.
π SIMILAR VOLUMES
## Abstract Ideally, the score vectors numerically computed by an orthogonal scores partial least squares (PLS) algorithm should be orthogonal close to machine precision. However, this is not ensured without taking special precautions. The progressive loss of orthogonality with increasing number of
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
We consider a paper by about a new contour lines algorithm. Because of its exactness and its convincing straightforwardness we have tested it and incorporated it into our postprocessing software. This paper describes some aspects we experienced during the numerical experimentation which may be help