Matrix completion discriminant analysis

DOI10.1016/J.CSDA.2015.06.006zbMATH Open1468.62212DBLPjournals/csda/WuL15aOpenAlexW2196439578WikidataQ36252839 ScholiaQ36252839MaRDI QIDQ1663150FDOQ1663150

Authors: Tong Tong Wu, Kenneth 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

Recommendations

• Matrix completion via an alternating direction method
• Matrix completion problems
• Matrix completion with covariate information
• On a Class of Matrix Completion Problems
• Matrix Completion, Counterfactuals, and Factor Analysis of Missing Data
• A graphical approach to the analysis of matrix completion
• Matrix Completion à la Dempster by the Principle of Parsimony
• Computation of regularized linear discriminant analysis
• Some empirical advances in matrix completion

zbMATH Keywords

classificationMM algorithmsingular value decompositionsemi-supervised learningmissing observations

Mathematics Subject Classification ID

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

Cites Work

• Spectral regularization algorithms for learning large incomplete matrices
• Matrix completion and low-rank SVD via fast alternating least squares
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Singular Value Thresholding Algorithm for Matrix Completion
• Title not available (Why is that?)
• Exact matrix completion via convex optimization
• Handling missing values when applying classification models
• Title not available (Why is that?)
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• An investigation of missing data methods for classification trees applied to binary response data
• Soft and hard classification by reproducing kernel Hilbert space methods
• Title not available (Why is that?)
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Matrix completion via an alternating direction method
• Fixed point and Bregman iterative methods for matrix rank minimization
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
• Hard or soft classification? Large-margin unified machines
• A simpler approach to matrix completion
• Low-rank matrix completion using alternating minimization
• Convex analysis and nonlinear optimization. Theory and examples.
• Structured variable selection and estimation
• Nonlinear vertex discriminant analysis with reproducing kernels
• Multicategory vertex discriminant analysis for high-dimensional data
• Impact of imputation of missing values on classification error for discrete data
• Orthogonal rank-one matrix pursuit for low rank matrix completion
• The minimum-rank Gram matrix completion via modified fixed point continuation method

Cited In (2)

• Matrix completion from a computational statistics perspective
• Going Off the Grid: Iterative Model Selection for Biclustered Matrix Completion

Uses Software

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

This page was built for publication: Matrix completion discriminant analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663150)