Lower Rank Approximation of Matrices by Least Squares with Any Choice of Weights

From MaRDI portal
Publication:3924961

DOI10.2307/1268288zbMath0471.62004OpenAlexW4255897207MaRDI QIDQ3924961

Shmuel Zamir, K. Ruben Gabriel

Publication date: 1979

Full work available at URL: https://doi.org/10.2307/1268288




Related Items

Graph partitioning by correspondence analysis and taxicab correspondence analysisRobust low-rank data matrix approximationsResistant lower rank approximation of matrices by iterative majorizationWeighted least squares fitting using ordinary least squares algorithmsA unifying theory of tests of rankReduced-rank models for interaction in unequally replicated two-way classificationsWeighted and robust learning of subspace representationsLeft vs, right representations for solving weighted low-rank approximation problemsRobust regularized singular value decomposition with application to mortality dataA robust biplotLogistic biplot for nominal dataA gradual rank increasing process for matrix completionWeighted norms in subspace-based methods for time series analysisMultiple hypothesis testing adjusted for latent variables, with an application to the AGEMAP gene expression dataSelecting the number of components in principal component analysis using cross-validation approximationsStability of principal component analysis studied by the bootstrap methodUnnamed ItemA majorization algorithm for simultaneous parameter estimation in robust exploratory factor analysisStatistical inference based on robust low-rank data matrix approximationSparse principal component analysis via regularized low rank matrix approximationFast computation of robust subspace estimatorsGBMs: GLMs with bilinear termsCommemoration of the bicentennial of the publication (1805--1806) of the least squares method by Adrien Marie LegendreMultiple taxicab correspondence analysisAnother look at Bayesian analysis of AMMI models for genotype-environment dataAn algorithm for weighted bilinear regressionL1-norm projection pursuit principal component analysisComparisons among several methods for handling missing data in principal component analysis (PCA)Block tensor train decomposition for missing data estimationUse of multiple singular value decompositions to analyze complex intracellular calcium ion signalsMultiple imputation in principal component analysisNearest neighbours in least-squares data imputation algorithms with different missing patternsNearest neighbour approach in the least-squares data imputation algorithmsA multivariate reduced-rank growth curve model with unbalanced dataGeneralized structured component analysisForecasting time series of inhomogeneous Poisson processes with application to call center workforce managementLow-rank matrix approximation in the infinity normThe incompleteness problem of the APT modelPrincipal component analysis with external information on both subjects and variablesWeighted estimation of AMMI and GGE modelsIntraday forecasts of a volatility index: functional time series methods with dynamic updatingPractical matrix completion and corruption recovery using proximal alternating robust subspace minimization\(M\)-type smoothing spline estimators for principal functionsRobust centroid methodStructured total least squares and \(L_ 2\) approximation problemsOn the Complexity of Robust PCA and 1-Norm Low-Rank Matrix ApproximationA weighted POD method for elliptic PDEs with random inputsNearest Neighbour in Least Squares Data Imputation Algorithms for Marketing DataSome new aspects of taxicab correspondence analysisA Tale of Two Matrix FactorizationsHandling missing values with regularized iterative multiple correspondence analysis




This page was built for publication: Lower Rank Approximation of Matrices by Least Squares with Any Choice of Weights