Matrix completion discriminant analysis

DOI10.1016/j.csda.2015.06.006zbMath1468.62212OpenAlexW2196439578WikidataQ36252839 ScholiaQ36252839MaRDI QIDQ1663150

Tong Tong Wu, Kenneth L. Lange

Publication date: 21 August 2018

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2015.06.006

zbMATH Keywords

classificationsingular value decompositionmissing observationssemi-supervised learningMM algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical linear algebra (65F99) Matrix completion problems (15A83)

Related Items

Going Off the Grid: Iterative Model Selection for Biclustered Matrix Completion

Uses Software

• UCI-ml
• MICE
• LMaFit
• softImpute
• missForest
• upclass

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
• Multicategory vertex discriminant analysis for high-dimensional data
• Fixed point and Bregman iterative methods for matrix rank minimization
• Convex analysis and nonlinear optimization. Theory and examples.
• Impact of imputation of missing values on classification error for discrete data
• Structured variable selection and estimation
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Exact matrix completion via convex optimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Matrix completion via an alternating direction method
• Nonlinear vertex discriminant analysis with reproducing kernels
• Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
• The minimum-rank gram matrix completion via modified fixed point continuation method
• Hard or Soft Classification? Large-Margin Unified Machines
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Simpler Approach to Matrix Completion
• Soft and hard classification by reproducing kernel Hilbert space methods
• Low-rank matrix completion using alternating minimization
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization