Comments on the PLS kernel algorithm

1994/03/01 by Sijmen de Jong, Cajo J. F. ter Braak · 1 citation
Chemistry · Biochemistry, Genetics and Molecular Biology · #Spectroscopy and Chemometric Analyses #Analytical Chemistry and Chromatography #Metabolomics and Mass Spectrometry Studies

paper · doi:10.1002/cem.1180080208

openalex publication_date 1994/03/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/29

Abstract

Abstract Lindgren et al. ( J. Chemometrics , 7 , 45–49 (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 X T X , Y T Y and X T Y . The algorithm is now described in a shorter and more transparent way and compared with a similar algorithm for the singular value decomposition of X T Y .

Citations

• PLS regression methods
• SIMPLS: An alternative approach to partial least squares regression
• The Approximation of One Matrix by Another of Lower Rank
• The kernel algorithm for PLS
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Comparison of Several Algorithms for Computing Sample Means and Variances

Cited by

• Partial least squares regression [wikipedia]