Partial least squares regression

We are given a sample of 
 
 
 
 n
 
 
 {\displaystyle n}
 
 <a href="/facts/Paired_data/eCPXGtff">paired</a> observations 
 
 
 
 (
 
 
 
 
 x
 →
 
 
 
 
 i
 
 
 ,
 
 
 
 
 y
 →
 
 
 
 
 i
 
 
 )
 ,
 i
 ∈
 
 1
 ,
 …
 ,
 n
 
 
 
 {\displaystyle ({\vec {x}}_{i},{\vec {y}}_{i}),i\in {1,\ldots ,n}}
 
.
In the first step 
 
 
 
 j
 =
 1
 
 
 {\displaystyle j=1}
 
, the partial least squares regression searches for the normalized direction 
 
 
 
 
 
 
 
 p
 →
 
 
 
 
 j
 
 
 
 
 {\displaystyle {\vec {p}}_{j}}
 
, 
 
 
 
 
 
 
 
 q
 →
 
 
 
 
 j
 
 
 
 
 {\displaystyle {\vec {q}}_{j}}
 
 that maximizes the covariance<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a>

max
          
            
              
                
                  
                    p
                    →
                  
                
              
              
                j
              
            
            ,
            
              
                
                  
                    q
                    →
                  
                
              
              
                j
              
            
          
        
        E
        ⁡
        [
        
          
            
              
                (
                
                  
                    
                      
                        p
                        →
                      
                    
                  
                  
                    j
                  
                
                ⋅
                
                  
                    
                      X
                      →
                    
                  
                
                )
              
              ⏟
            
          
          
            
              t
              
                j
              
            
          
        
        
          
            
              
                (
                
                  
                    
                      
                        q
                        →
                      
                    
                  
                  
                    j
                  
                
                ⋅
                
                  
                    
                      Y
                      →
                    
                  
                
                )
              
              ⏟
            
          
          
            
              u
              
                j
              
            
          
        
        ]
        .
      
    
    {\displaystyle \max _{{\vec {p}}_{j},{\vec {q}}_{j}}\operatorname {E} [\underbrace {({\vec {p}}_{j}\cdot {\vec {X}})} _{t_{j}}\underbrace {({\vec {q}}_{j}\cdot {\vec {Y}})} _{u_{j}}].}

Note below, the algorithm is denoted in matrix notation.

<h2 id="underlying-model">Underlying model</h2>
The general underlying model of multivariate PLS with 
 
 
 
 ℓ
 
 
 {\displaystyle \ell }
 
 components is

X
        =
        T
        
          P
          
            
              T
            
          
        
        +
        E
      
    
    {\displaystyle X=TP^{\mathrm {T} }+E}

Y
        =
        U
        
          Q
          
            
              T
            
          
        
        +
        F
      
    
    {\displaystyle Y=UQ^{\mathrm {T} }+F}

where 

<ul><li>X is an 
 
 
 
 n
 ×
 m
 
 
 {\displaystyle n\times m}
 
 matrix of predictors</li>
<li>Y is an 
 
 
 
 n
 ×
 p
 
 
 {\displaystyle n\times p}
 
 matrix of responses</li>
<li>T and U are 
 
 
 
 n
 ×
 ℓ
 
 
 {\displaystyle n\times \ell }
 
 matrices that are, respectively, projections of X (the X score, component or factor matrix) and projections of Y (the Y scores)</li>
<li>P and Q are, respectively, 
 
 
 
 m
 ×
 ℓ
 
 
 {\displaystyle m\times \ell }
 
 and 
 
 
 
 p
 ×
 ℓ
 
 
 {\displaystyle p\times \ell }
 
 loading matrices</li>
<li>and matrices E and F are the error terms, assumed to be independent and identically distributed random normal variables.</li></ul>
The decompositions of X and Y are made so as to maximise the <a href="/facts/Covariance/hILocGNH">covariance</a> between T and U.
Note that this covariance is defined pair by pair: the covariance of column i of T (length n) with the column i of U (length n) is maximized. Additionally, the covariance of the column i of T with the column j of U (with 
 
 
 
 i
 ≠
 j
 
 
 {\displaystyle i\neq j}
 
) is zero.
In PLSR, the loadings are thus chosen so that the scores form an orthogonal basis. This is a major difference with PCA where orthogonality is imposed onto loadings (and not the scores).

<h2 id="algorithms">Algorithms</h2>
A number of variants of PLS exist for estimating the factor and loading matrices T, U, P and Q. Most of them construct estimates of the linear regression between X and Y as 
 
 
 
 Y
 =
 X
 
 
 
 B
 ~
 
 
 
 +
 
 
 
 
 B
 ~
 
 
 
 
 0
 
 
 
 
 {\displaystyle Y=X{\tilde {B}}+{\tilde {B}}_{0}}
 
. Some PLS algorithms are only appropriate for the case where Y is a column vector, while others deal with the general case of a matrix Y. Algorithms also differ on whether they estimate the factor matrix T as an orthogonal (that is, <a href="/facts/Orthonormal_matrix/WDXBXYB5">orthonormal</a>) matrix or not.<a class="footnote-ref" id="fnref:5" href="#fn:5">5</a><a class="footnote-ref" id="fnref:6" href="#fn:6">6</a><a class="footnote-ref" id="fnref:7" href="#fn:7">7</a><a class="footnote-ref" id="fnref:8" href="#fn:8">8</a><a class="footnote-ref" id="fnref:9" href="#fn:9">9</a><a class="footnote-ref" id="fnref:10" href="#fn:10">10</a> 
The final prediction will be the same for all these varieties of PLS, but the components will differ.
PLS is composed of iteratively repeating the following steps k times (for k components):

<ol><li>finding the directions of maximal covariance in input and output space</li>
<li>performing least squares regression on the input score</li>
<li>deflating the input 
 
 
 
 X
 
 
 {\displaystyle X}
 
 and/or target 
 
 
 
 Y
 
 
 {\displaystyle Y}
 
</li></ol>
<h3>PLS1</h3>
PLS1 is a widely used algorithm appropriate for the vector Y case. It estimates T as an orthonormal matrix.
(Caution: the t vectors in the code below may not be normalized appropriately; see talk.)
In pseudocode it is expressed below (capital letters are matrices, lower case letters are vectors if they are superscripted and scalars if they are subscripted).

 1 function PLS1(X, y, ℓ)
 2 
 
 
 
 
 X
 
 (
 0
 )
 
 
 ←
 X
 
 
 {\displaystyle X^{(0)}\gets X}

3     
  
    
      
        
          w
          
            (
            0
            )
          
        
        ←
        
          X
          
            
              T
            
          
        
        y
        
          /
        
        ‖
        
          X
          
            
              T
            
          
        
        y
        ‖
      
    
    {\displaystyle w^{(0)}\gets X^{\mathrm {T} }y/\|X^{\mathrm {T} }y\|}
  
, an initial estimate of w.
 4     for 
  
    
      
        k
        =
        0
      
    
    {\displaystyle k=0}
  
 to 
  
    
      
        ℓ
        −
        1
      
    
    {\displaystyle \ell -1}

5         
  
    
      
        
          t
          
            (
            k
            )
          
        
        ←
        
          X
          
            (
            k
            )
          
        
        
          w
          
            (
            k
            )
          
        
      
    
    {\displaystyle t^{(k)}\gets X^{(k)}w^{(k)}}

6         
  
    
      
        
          t
          
            k
          
        
        ←
        
          
            
              t
              
                (
                k
                )
              
            
          
          
            
              T
            
          
        
        
          t
          
            (
            k
            )
          
        
      
    
    {\displaystyle t_{k}\gets {t^{(k)}}^{\mathrm {T} }t^{(k)}}
  
 (note this is a scalar)
 7         
  
    
      
        
          t
          
            (
            k
            )
          
        
        ←
        
          t
          
            (
            k
            )
          
        
        
          /
        
        
          t
          
            k
          
        
      
    
    {\displaystyle t^{(k)}\gets t^{(k)}/t_{k}}

8         
  
    
      
        
          p
          
            (
            k
            )
          
        
        ←
        
          
            
              X
              
                (
                k
                )
              
            
          
          
            
              T
            
          
        
        
          t
          
            (
            k
            )
          
        
      
    
    {\displaystyle p^{(k)}\gets {X^{(k)}}^{\mathrm {T} }t^{(k)}}

9         
  
    
      
        
          q
          
            k
          
        
        ←
        
          
            y
          
          
            
              T
            
          
        
        
          t
          
            (
            k
            )
          
        
      
    
    {\displaystyle q_{k}\gets {y}^{\mathrm {T} }t^{(k)}}
  
 (note this is a scalar)
10         if 
  
    
      
        
          q
          
            k
          
        
        =
        0
      
    
    {\displaystyle q_{k}=0}

11 
 
 
 
 ℓ
 ←
 k
 
 
 {\displaystyle \ell \gets k}
 
, break the for loop
12 if 
 
 
 
 k
 <
 (
 ℓ
 −
 1
 )
 
 
 {\displaystyle k<(\ell -1)}

13             
  
    
      
        
          X
          
            (
            k
            +
            1
            )
          
        
        ←
        
          X
          
            (
            k
            )
          
        
        −
        
          t
          
            k
          
        
        
          t
          
            (
            k
            )
          
        
        
          
            
              p
              
                (
                k
                )
              
            
          
          
            
              T
            
          
        
      
    
    {\displaystyle X^{(k+1)}\gets X^{(k)}-t_{k}t^{(k)}{p^{(k)}}^{\mathrm {T} }}

14             
  
    
      
        
          w
          
            (
            k
            +
            1
            )
          
        
        ←
        
          
            
              X
              
                (
                k
                +
                1
                )
              
            
          
          
            
              T
            
          
        
        y
      
    
    {\displaystyle w^{(k+1)}\gets {X^{(k+1)}}^{\mathrm {T} }y}

15     end for
16     define W to be the matrix with columns 
  
    
      
        
          w
          
            (
            0
            )
          
        
        ,
        
          w
          
            (
            1
            )
          
        
        ,
        …
        ,
        
          w
          
            (
            ℓ
            −
            1
            )
          
        
      
    
    {\displaystyle w^{(0)},w^{(1)},\ldots ,w^{(\ell -1)}}
  
.
       Do the same to form the P matrix and q vector.
17     
  
    
      
        B
        ←
        W
        
          
            (
            
              P
              
                
                  T
                
              
            
            W
            )
          
          
            −
            1
          
        
        q
      
    
    {\displaystyle B\gets W{(P^{\mathrm {T} }W)}^{-1}q}

18     
  
    
      
        
          B
          
            0
          
        
        ←
        
          q
          
            0
          
        
        −
        
          
            
              P
              
                (
                0
                )
              
            
          
          
            
              T
            
          
        
        B
      
    
    {\displaystyle B_{0}\gets q_{0}-{P^{(0)}}^{\mathrm {T} }B}

19     return 
  
    
      
        B
        ,
        
          B
          
            0
          
        
      
    
    {\displaystyle B,B_{0}}

This form of the algorithm does not require centering of the input X and Y, as this is performed implicitly by the algorithm.
This algorithm features 'deflation' of the matrix X (subtraction of 
 
 
 
 
 t
 
 k
 
 
 
 t
 
 (
 k
 )
 
 
 
 
 
 p
 
 (
 k
 )
 
 
 
 
 
 T
 
 
 
 
 
 {\displaystyle t_{k}t^{(k)}{p^{(k)}}^{\mathrm {T} }}
 
), but deflation of the vector y is not performed, as it is not necessary (it can be proved that deflating y yields the same results as not deflating<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a>). The user-supplied variable l is the limit on the number of latent factors in the regression; if it equals the rank of the matrix X, the algorithm will yield the least squares regression estimates for B and 
 
 
 
 
 B
 
 0
 
 
 
 
 {\displaystyle B_{0}}

<h2 id="extensions">Extensions</h2>
<h3>OPLS</h3>
In 2002 a new method was published called orthogonal projections to latent structures (OPLS). In OPLS, continuous variable data is separated into predictive and uncorrelated (orthogonal) information. This leads to improved diagnostics, as well as more easily interpreted visualization. However, these changes only improve the interpretability, not the predictivity, of the PLS models.<a class="footnote-ref" id="fnref:12" href="#fn:12">12</a> Similarly, OPLS-DA (Discriminant Analysis) may be applied when working with discrete variables, as in classification and biomarker studies.
The general underlying model of OPLS is

X
        =
        T
        
          P
          
            
              T
            
          
        
        +
        
          T
          
            Y-orth
          
        
        
          P
          
            Y-orth
          
          
            
              T
            
          
        
        +
        E
      
    
    {\displaystyle X=TP^{\mathrm {T} }+T_{\text{Y-orth}}P_{\text{Y-orth}}^{\mathrm {T} }+E}

Y
        =
        U
        
          Q
          
            
              T
            
          
        
        +
        F
      
    
    {\displaystyle Y=UQ^{\mathrm {T} }+F}

or in O2-PLS<a class="footnote-ref" id="fnref:13" href="#fn:13">13</a>

Y
        =
        U
        
          Q
          
            
              T
            
          
        
        +
        
          U
          
            X-orth
          
        
        
          Q
          
            X-orth
          
          
            
              T
            
          
        
        +
        F
      
    
    {\displaystyle Y=UQ^{\mathrm {T} }+U_{\text{X-orth}}Q_{\text{X-orth}}^{\mathrm {T} }+F}

<h3>L-PLS</h3>
Another extension of PLS regression, named L-PLS for its L-shaped matrices, connects 3 related data blocks to improve predictability.<a class="footnote-ref" id="fnref:14" href="#fn:14">14</a> In brief, a new Z matrix, with the same number of columns as the X matrix, is added to the PLS regression analysis and may be suitable for including additional background information on the interdependence of the predictor variables.

<h3>3PRF</h3>
In 2015 partial least squares was related to a procedure called the three-pass regression filter (3PRF).<a class="footnote-ref" id="fnref:15" href="#fn:15">15</a> Supposing the number of observations and variables are large, the 3PRF (and hence PLS) is asymptotically normal for the "best" forecast implied by a linear latent factor model. In stock market data, PLS has been shown to provide accurate out-of-sample forecasts of returns and cash-flow growth.<a class="footnote-ref" id="fnref:16" href="#fn:16">16</a>

<h3>Partial least squares SVD</h3>
A PLS version based on <a href="/facts/Singular_value_decomposition/8t3v6wk3">singular value decomposition (SVD)</a> provides a memory efficient implementation that can be used to address high-dimensional problems, such as relating millions of genetic markers to thousands of imaging features in imaging genetics, on consumer-grade hardware.<a class="footnote-ref" id="fnref:17" href="#fn:17">17</a>

<h3>PLS correlation</h3>
PLS correlation (PLSC) is another methodology related to PLS regression,<a class="footnote-ref" id="fnref:18" href="#fn:18">18</a> which has been used in neuroimaging <a class="footnote-ref" id="fnref:19" href="#fn:19">19</a><a class="footnote-ref" id="fnref:20" href="#fn:20">20</a><a class="footnote-ref" id="fnref:21" href="#fn:21">21</a> and sport science,<a class="footnote-ref" id="fnref:22" href="#fn:22">22</a> to quantify the strength of the relationship between data sets. Typically, PLSC divides the data into two blocks (sub-groups) each containing one or more variables, and then uses <a href="/facts/Singular_value_decomposition/8t3v6wk3">singular value decomposition (SVD)</a> to establish the strength of any relationship (i.e. the amount of shared information) that might exist between the two component sub-groups.<a class="footnote-ref" id="fnref:23" href="#fn:23">23</a> It does this by using SVD to determine the inertia (i.e. the sum of the singular values) of the covariance matrix of the sub-groups under consideration.<a class="footnote-ref" id="fnref:24" href="#fn:24">24</a><a class="footnote-ref" id="fnref:25" href="#fn:25">25</a>

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Canonical_correlation/LuX8FltG">Canonical correlation</a></li>
<li><a href="/facts/Data_mining/AH53q5ac">Data mining</a></li>
<li><a href="/facts/Deming_regression/j4bFDpub">Deming regression</a></li>
<li><a href="/facts/Feature_extraction/BSMX5e8I">Feature extraction</a></li>
<li><a href="/facts/Machine_learning/e0w0XJTu">Machine learning</a></li>
<li><a href="/facts/Partial_least_squares_path_modeling/tvJyY2P1">Partial least squares path modeling</a></li>
<li><a href="/facts/Principal_component_analysis/pCbVTqdR">Principal component analysis</a></li>
<li><a href="/facts/Regression_analysis/n6z5Tf7K">Regression analysis</a></li>
<li><a href="/facts/Total_sum_of_squares/brFhGeVT">Total sum of squares</a></li>
<li><a href="/facts/Projection_pursuit_regression/SnnzJYLp">Projection pursuit regression</a></li></ul>

<h2 id="literature">Literature</h2>
<ul><li>Kramer, R. (1998). Chemometric Techniques for Quantitative Analysis. Marcel-Dekker. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-8247-0198-7.</li>
<li>Frank, Ildiko E.; Friedman, Jerome H. (1993). "A Statistical View of Some Chemometrics Regression Tools". Technometrics. 35 (2): 109–148. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1080%2F00401706.1993.10485033">10.1080/00401706.1993.10485033</a>.</li>
<li>Haenlein, Michael; Kaplan, Andreas M. (2004). "A Beginner's Guide to Partial Least Squares Analysis". Understanding Statistics. 3 (4): 283–297. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1207%2Fs15328031us0304_4">10.1207/s15328031us0304_4</a>.</li>
<li>Henseler, Jörg; Fassott, Georg (2010). "Testing Moderating Effects in PLS Path Models: An Illustration of Available Procedures". In Vinzi, Vincenzo Esposito; Chin, Wynne W.; Henseler, Jörg; Wang, Huiwen (eds.). Handbook of Partial Least Squares: Concepts, Methods and Applications. Springer. pp. 713–735. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1007%2F978-3-540-32827-8_31">10.1007/978-3-540-32827-8_31</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 9783540328278.</li>
<li>Lingjærde, Ole-Christian; Christophersen, Nils (2000). "Shrinkage Structure of Partial Least Squares". Scandinavian Journal of Statistics. 27 (3): 459–473. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1111%2F1467-9469.00201">10.1111/1467-9469.00201</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:121489764">121489764</a>.</li>
<li>Tenenhaus, Michel (1998). La Régression PLS: Théorie et Pratique. Paris: Technip.</li>
<li>Rosipal, Roman; Krämer, Nicole (2006). "Overview and Recent Advances in Partial Least Squares". In Saunders, Craig; Grobelnik, Marko; Gunn, Steve; Shawe-Taylor, John (eds.). Subspace, Latent Structure and Feature Selection: Statistical and Optimization Perspectives Workshop, SLSFS 2005, Bohinj, Slovenia, February 23–25, 2005, Revised Selected Papers. Lecture Notes in Computer Science. Springer. pp. 34–51. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1007%2F11752790_2">10.1007/11752790_2</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 9783540341383.</li>
<li>Helland, Inge S. (1990). "PLS regression and statistical models". Scandinavian Journal of Statistics. 17 (2): 97–114. <a href="/facts/JSTOR_(identifier)/YTeVmaJ7">JSTOR</a> <a href="https://www.jstor.org/stable/4616159">4616159</a>.</li>
<li><a href="/facts/Herman_Wold/ubWRKL81">Wold, Herman</a> (1966). "Estimation of principal components and related models by iterative least squares". In Krishnaiaah, P.R. (ed.). Multivariate Analysis. New York: Academic Press. pp. 391–420.</li>
<li>Wold, Herman (1981). The fix-point approach to interdependent systems. Amsterdam: North Holland.</li>
<li>Wold, Herman (1985). "Partial least squares". In Kotz, Samuel; Johnson, Norman L. (eds.). Encyclopedia of statistical sciences. Vol. 6. New York: Wiley. pp. 581–591.</li>
<li>Wold, Svante; Ruhe, Axel; Wold, Herman; Dunn, W.J. (1984). "The collinearity problem in linear regression. the partial least squares (PLS) approach to generalized inverses". SIAM Journal on Scientific and Statistical Computing. 5 (3): 735–743. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1137%2F0905052">10.1137/0905052</a>.</li>
<li>Garthwaite, Paul H. (1994). "An Interpretation of Partial Least Squares". <a href="/facts/Journal_of_the_American_Statistical_Association/H513IjxL">Journal of the American Statistical Association</a>. 89 (425): 122–7. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1080%2F01621459.1994.10476452">10.1080/01621459.1994.10476452</a>. <a href="/facts/JSTOR_(identifier)/YTeVmaJ7">JSTOR</a> <a href="https://www.jstor.org/stable/2291207">2291207</a>.</li>
<li>Wang, H., ed. (2010). Handbook of Partial Least Squares. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-3-540-32825-4.</li>
<li>Stone, M.; Brooks, R.J. (1990). "Continuum Regression: Cross-Validated Sequentially Constructed Prediction embracing Ordinary Least Squares, Partial Least Squares and Principal Components Regression". Journal of the Royal Statistical Society, Series B. 52 (2): 237–269. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1111%2Fj.2517-6161.1990.tb01786.x">10.1111/j.2517-6161.1990.tb01786.x</a>. <a href="/facts/JSTOR_(identifier)/YTeVmaJ7">JSTOR</a> <a href="https://www.jstor.org/stable/2345437">2345437</a>.</li></ul>
<h2 id="external-links">External links</h2>
<ul><li><a href="https://personal.utdallas.edu/~herve/Abdi-PLS-pretty.pdf">A short introduction to PLS regression and its history</a></li>
<li><a href="https://www.youtube.com/watch?v=Px2otK2nZ1c">Video: Derivation of PLS by Prof. H. Harry Asada</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Schmidli, Heinz (13 March 2013). Reduced Rank Regression: With Applications to Quantitative Structure-Activity Relationships. Springer. ISBN 978-3-642-50015-2. <a href="978-3-642-50015-2" target="_blank">978-3-642-50015-2</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Wold, S; Sjöström, M.; Eriksson, L. (2001). "PLS-regression: a basic tool of chemometrics". Chemometrics and Intelligent Laboratory Systems. 58 (2): 109–130. doi:10.1016/S0169-7439(01)00155-1. S2CID 11920190. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Abdi, Hervé (2010). "Partial least squares regression and projection on latent structure regression (PLS Regression)". WIREs Computational Statistics. 2: 97–106. doi:10.1002/wics.51. S2CID 122685021. <a href="https://wires.onlinelibrary.wiley.com/doi/epdf/10.1002/wics.51" target="_blank">https://wires.onlinelibrary.wiley.com/doi/epdf/10.1002/wics.51</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">See lecture https://www.youtube.com/watch?v=Px2otK2nZ1c&t=46s <a href="https://www.youtube.com/watch?v=Px2otK2nZ1c&t=46s" target="_blank">https://www.youtube.com/watch?v=Px2otK2nZ1c&t=46s</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">Lindgren, F; Geladi, P; Wold, S (1993). "The kernel algorithm for PLS". J. Chemometrics. 7: 45–59. doi:10.1002/cem.1180070104. S2CID 122950427. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">de Jong, S.; ter Braak, C.J.F. (1994). "Comments on the PLS kernel algorithm". J. Chemometrics. 8 (2): 169–174. doi:10.1002/cem.1180080208. S2CID 221549296. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Dayal, B.S.; MacGregor, J.F. (1997). "Improved PLS algorithms". J. Chemometrics. 11 (1): 73–85. doi:10.1002/(SICI)1099-128X(199701)11:1<73::AID-CEM435>3.0.CO;2-#. S2CID 120753851. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">de Jong, S. (1993). "SIMPLS: an alternative approach to partial least squares regression". Chemometrics and Intelligent Laboratory Systems. 18 (3): 251–263. doi:10.1016/0169-7439(93)85002-X. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Rannar, S.; Lindgren, F.; Geladi, P.; Wold, S. (1994). "A PLS Kernel Algorithm for Data Sets with Many Variables and Fewer Objects. Part 1: Theory and Algorithm". J. Chemometrics. 8 (2): 111–125. doi:10.1002/cem.1180080204. S2CID 121613293. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Abdi, H. (2010). "Partial least squares regression and projection on latent structure regression (PLS-Regression)". Wiley Interdisciplinary Reviews: Computational Statistics. 2: 97–106. doi:10.1002/wics.51. S2CID 122685021. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">Höskuldsson, Agnar (1988). "PLS Regression Methods". Journal of Chemometrics. 2 (3): 219. doi:10.1002/cem.1180020306. S2CID 120052390. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Trygg, J; Wold, S (2002). "Orthogonal Projections to Latent Structures". Journal of Chemometrics. 16 (3): 119–128. doi:10.1002/cem.695. S2CID 122699039. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
<li id="fn:13">Eriksson, S. Wold, and J. Tryg. "O2PLS® for improved analysis and visualization of complex data." https://www.dynacentrix.com/telecharg/SimcaP/O2PLS.pdf <a href="https://www.dynacentrix.com/telecharg/SimcaP/O2PLS.pdf" target="_blank">https://www.dynacentrix.com/telecharg/SimcaP/O2PLS.pdf</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></li>
<li id="fn:14">Sæbøa, S.; Almøya, T.; Flatbergb, A.; Aastveita, A.H.; Martens, H. (2008). "LPLS-regression: a method for prediction and classification under the influence of background information on predictor variables". Chemometrics and Intelligent Laboratory Systems. 91 (2): 121–132. doi:10.1016/j.chemolab.2007.10.006. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></li>
<li id="fn:15">Kelly, Bryan; Pruitt, Seth (2015-06-01). "The three-pass regression filter: A new approach to forecasting using many predictors". Journal of Econometrics. High Dimensional Problems in Econometrics. 186 (2): 294–316. doi:10.1016/j.jeconom.2015.02.011. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></li>
<li id="fn:16">Kelly, Bryan; Pruitt, Seth (2013-10-01). "Market Expectations in the Cross-Section of Present Values". The Journal of Finance. 68 (5): 1721–1756. CiteSeerX 10.1.1.498.5973. doi:10.1111/jofi.12060. ISSN 1540-6261. <a href="/wiki/CiteSeerX_(identifier)" target="_blank">/wiki/CiteSeerX_(identifier)</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></li>
<li id="fn:17">Lorenzi, Marco; Altmann, Andre; Gutman, Boris; Wray, Selina; Arber, Charles; Hibar, Derrek P.; Jahanshad, Neda; Schott, Jonathan M.; Alexander, Daniel C. (2018-03-20). "Susceptibility of brain atrophy to TRIB3 in Alzheimer's disease, evidence from functional prioritization in imaging genetics". Proceedings of the National Academy of Sciences. 115 (12): 3162–3167. Bibcode:2018PNAS..115.3162L. doi:10.1073/pnas.1706100115. ISSN 0027-8424. PMC 5866534. PMID 29511103. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5866534" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5866534</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></li>
<li id="fn:18">Krishnan, Anjali; Williams, Lynne J.; McIntosh, Anthony Randal; Abdi, Hervé (May 2011). "Partial Least Squares (PLS) methods for neuroimaging: A tutorial and review". NeuroImage. 56 (2): 455–475. doi:10.1016/j.neuroimage.2010.07.034. PMID 20656037. S2CID 8796113. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></li>
<li id="fn:19">Krishnan, Anjali; Williams, Lynne J.; McIntosh, Anthony Randal; Abdi, Hervé (May 2011). "Partial Least Squares (PLS) methods for neuroimaging: A tutorial and review". NeuroImage. 56 (2): 455–475. doi:10.1016/j.neuroimage.2010.07.034. PMID 20656037. S2CID 8796113. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></li>
<li id="fn:20">McIntosh, Anthony R.; Mišić, Bratislav (2013-01-03). "Multivariate Statistical Analyses for Neuroimaging Data". Annual Review of Psychology. 64 (1): 499–525. doi:10.1146/annurev-psych-113011-143804. ISSN 0066-4308. PMID 22804773. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></li>
<li id="fn:21">Beggs, Clive B.; Magnano, Christopher; Belov, Pavel; Krawiecki, Jacqueline; Ramasamy, Deepa P.; Hagemeier, Jesper; Zivadinov, Robert (2016-05-02). de Castro, Fernando (ed.). "Internal Jugular Vein Cross-Sectional Area and Cerebrospinal Fluid Pulsatility in the Aqueduct of Sylvius: A Comparative Study between Healthy Subjects and Multiple Sclerosis Patients". PLOS ONE. 11 (5): e0153960. Bibcode:2016PLoSO..1153960B. doi:10.1371/journal.pone.0153960. ISSN 1932-6203. PMC 4852898. PMID 27135831. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4852898" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4852898</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></li>
<li id="fn:22">Weaving, Dan; Jones, Ben; Ireton, Matt; Whitehead, Sarah; Till, Kevin; Beggs, Clive B. (2019-02-14). Connaboy, Chris (ed.). "Overcoming the problem of multicollinearity in sports performance data: A novel application of partial least squares correlation analysis". PLOS ONE. 14 (2): e0211776. Bibcode:2019PLoSO..1411776W. doi:10.1371/journal.pone.0211776. ISSN 1932-6203. PMC 6375576. PMID 30763328. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6375576" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6375576</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></li>
<li id="fn:23">Abdi, Hervé; Williams, Lynne J. (2013), Reisfeld, Brad; Mayeno, Arthur N. (eds.), "Partial Least Squares Methods: Partial Least Squares Correlation and Partial Least Square Regression", Computational Toxicology, vol. 930, Humana Press, pp. 549–579, doi:10.1007/978-1-62703-059-5_23, ISBN 9781627030588, PMID 23086857 <a href="9781627030588" target="_blank">9781627030588</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></li>
<li id="fn:24">Abdi, Hervé; Williams, Lynne J. (2013), Reisfeld, Brad; Mayeno, Arthur N. (eds.), "Partial Least Squares Methods: Partial Least Squares Correlation and Partial Least Square Regression", Computational Toxicology, vol. 930, Humana Press, pp. 549–579, doi:10.1007/978-1-62703-059-5_23, ISBN 9781627030588, PMID 23086857 <a href="9781627030588" target="_blank">9781627030588</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></li>
<li id="fn:25">Krishnan, Anjali; Williams, Lynne J.; McIntosh, Anthony Randal; Abdi, Hervé (May 2011). "Partial Least Squares (PLS) methods for neuroimaging: A tutorial and review". NeuroImage. 56 (2): 455–475. doi:10.1016/j.neuroimage.2010.07.034. PMID 20656037. S2CID 8796113. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></li>
</ol>

Partial least squares regression open-in-new

Partial least squares regression