Missing value imputation in a data matrix using the regularised singular value decomposition

被引:1
作者
Arciniegas-Alarcon, Sergio [1 ]
Garcia-Pena, Marisol [2 ]
Krzanowski, Wojtek J. [3 ]
Rengifo, Camilo [1 ]
机构
[1] Univ Sabana, Fac Ingn, Chia, Colombia
[2] Pontificia Univ Javeriana, Dept Matemat, Bogota, Colombia
[3] Univ Exeter, Coll Engn Math & Phys Sci, Exeter, England
关键词
Eigenvalues; Eigenvectors; Iterative computational scheme; Cross-validation; Genotype-by-environment interaction; Overfitting; GGE BIPLOT;
D O I
10.1016/j.mex.2023.102289
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Some statistical analysis techniques may require complete data matrices, but a frequent problem in the construction of databases is the incomplete collection of information for different reasons. One option to tackle the problem is to estimate and impute the missing data. This paper describes a form of imputation that mixes regression with lower rank approximations. To improve the qual-ity of the imputations, a generalisation is proposed that replaces the singular value decomposition (SVD) of the matrix with a regularised SVD in which the regularisation parameter is estimated by cross-validation. To evaluate the performance of the proposal, ten sets of real data from mul-tienvironment trials were used. Missing values were created in each set at four percentages of missing not at random, and three criteria were then considered to investigate the effectiveness of the proposal. The results show that the regularised method proves very competitive when com-pared to the original method, beating it in several of the considered scenarios. As it is a very general system, its application can be extended to all multivariate data matrices. & BULL; The imputation method is modified through the inclusion of a stable and efficient compu-tational algorithm that replaces the classical SVD least squares criterion by a penalised cri-terion. This penalty produces smoothed eigenvectors and eigenvalues that avoid overfitting problems, improving the performance of the method when the penalty is necessary. The size of the penalty can be determined by minimising one of the following criteria: the prediction errors, the Procrustes similarity statistic or the critical angles between subspaces of principal components.
引用
收藏
页数:8
相关论文
共 32 条