Partial least squares NIPALS

H. Wold, Soft modelling by latent variables the non-linear iterative partial least squares (NIPALS) algorithm. In Perspectives in Probability and Statistics, J. Gani (Ed.). Academic Press, London, 1975, pp. 117-142. 

The nonlinear iterative partial least-squares (NIPALS) algorithm, also called power method, has been popular especially in the early time of PCA applications in chemistry an extended version is used in PLS regression. The algorithm is efficient if only a few PCA components are required because the components are calculated step-by-step. 

There are a variety of methods used to obtain the loading and scores matrix in Eq. (15). Perhaps, the most common methods employed are non-linear iterative partial least squares (NIPALS), and the singular value decomposition (SVD). Being an iterative method, NIPALS allows the user to calculate a minimum number of factors, whereas the SVD is more accurate and robust, but in most implementations provides all the factors, thus can be slow with large data sets. During SVD the data matrix can be expressed as... 

Wold H., Lyttkens E.. Nonlinear iterative partial least squares (NIPALS) estimation procedures in Bull. Intern. Statist. Inst. Proc., 37th session, London -15 1969. 

The simplest method for PCA used in analytics is the iterative nonlinear iterative partial least squares (NIPALS) algorithm explained in Example 5.1. More powerful methods are based on matrix diagonalization, such as SVD, or bidiagonalization, such as the partial least squares (PLS) method. 

The deeomposition in eqn (4.30) is general for PCR, PLS and other regression methods. These methods differ in the criterion (and the algorithm) used for ealeulating P and, hence, they characterise the ealibrators by different scores T. In PCR, T and P are found from the PCA of the data matrix R. Both the non-linear iterative partial least-squares (NIPALS) algorithm and the singular-value deeomposition (SVD) (much used, see Appendix) of R can be used to obtain the T and P used in PCA/PCR. In PLS, other algorithms are used to obtain T and P (see Chapter 5). 

How can one relate T, U, P and Q in such a way First, our previous knowledge of the problem and the analytical technique suggests that these blocks of data, which represent two different aspects of the same true materials (solutions, slurries, etc.), must be related (we do not know how, but they must ). The algorithm developed by H. Wold (called non-linear iterative partial least squares , NIPALS sometimes it is also termed non-iterative partial least squares ) started from this idea and was formulated as presented below. The following ideas have roots in works by Geladi (and co-workers) and Otto. We consider seven major steps. 

During the calibration step, the PLS technique assumes that the spectral data set X can be decomposed in the form of Equation 6.16. PLS factors are then computed with the help of iterative numerical procedures, such as the popular nonlinear iterative partial least squares (NIPALS) algorithm, as described in standard texts [46,74,75]. The PLS factors can be regarded as rotations of the PCA factors computed in... 

The main algorithms used for eigenvectors/eigenvalues computation differ in two aspects the matrix to work on, either X X (eigenvalue decomposition (EVD) and the POWER method) or X (singular value decomposition (SVD) and non-linear iterative partial least squares (NIPALS)). However SVD may work as well on X X (giving the same results as eigenvalue decomposition). Another difference is whether PCs are obtained simultaneously (EVD and SVD) or sequentially (POWER and NIPALS) for details and comparison of efficiency see Wu et al. [38]. In all the cases for which rows dimension I is much smaller than columns dimension /, one can operate on XX instead (EVD, POWER, SVD), and on X (NIPALS). 

One widely used algorithm for performing a PCA is the NIPALS (Nonlineai Iterative Partial Least Squares) algorithm, which is described in Ref [5],... 

NIPALS Nonlinear iterative partial least-squares... 

A more complex method is described by WOLD [1978], who used cross-validation to estimate the number of factors in FA and PCA. WOLD applied the NIPALS (non linear iterative partial least squares) algorithm and also mentioned its usefulness in cases of incomplete data. 

A straightforward method for PCA is the NIPALS (nonlinear iterative partial least squares) algorithm it is quickly implemented and can be applied to large datasets [58, 79],... 

PLS (Partial Least Squares) regression was used for quantification and classification of aristeromycin and neplanocin A (Figure 4). Matlab was used for PCA (Principal Components Analysis) (according to the NIPALS algorithm) to identify correlations amongst the variables from the 882 wavenumbers and reduce the number of inputs for Discriminant Function Analysis (DFA) (first 15 PCA scores used) (Figure 5). 

F2307.m PLS model identification for Zhao s data (Fig. 23.7 and Fig. 23.8) nipals.m PLS engine for partial least squares regression npls.m calculates PLS model using nipals algorithm... 

CV = cross-validation MLR = multiple linear regression mp = melting point NIPALS = nonlinear iterative partial least squares NN = neural networks PCA = principal... 

The PLS approach was developed around 1975 by Herman Wold and co-workers for the modeling of complicated data sets in terms of chains of matrices (blocks), so-called path models . Herman Wold developed a simple but efficient way to estimate the parameters in these models called NIPALS (nonlinear iterative partial least squares). This led, in turn, to the acronym PLS for these models, where PLS stood for partial least squares . This term describes the central part of the estimation, namely that each model parameter is iteratively estimated as the slope of a simple bivariate regression (least squares) between a matrix column or row as the y variable, and another parameter vector as the x variable. So, for instance, in each iteration the PLS weights w are re-estimated as u X/(u u). Here denotes u transpose, i.e., the transpose of the current u vector. The partial in PLS indicates that this is a partial regression, since the second parameter vector (u in the... 

---