论文信息 - Comments on the PLS kernel algorithm

Comments on the PLS kernel algorithm

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 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.

C. Braak | S. D. Jong

[1] C. Eckart,et al. The approximation of one matrix by another of lower rank , 1936 .

[2] Algorithm AS 41: Updating the Sample Mean and Dispersion Matrix , 1971 .

[3] A. Gourlay,et al. Computational Methods for Matrix Eigenproblems , 1973 .

[4] R. F. Ling. Comparison of Several Algorithms for Computing Sample Means and Variances , 1974 .

[5] Michael A. Saunders,et al. LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares , 1982, TOMS.

[6] R. Manne. Analysis of two partial-least-squares algorithms for multivariate calibration , 1987 .

[7] I. Helland. ON THE STRUCTURE OF PARTIAL LEAST SQUARES REGRESSION , 1988 .

[8] A. Höskuldsson. PLS regression methods , 1988 .

[9] S. Wold,et al. The kernel algorithm for PLS , 1993 .

[10] S. D. Jong. SIMPLS: an alternative approach to partial least squares regression , 1993 .