A divide-and-conquer algorithm for binary matrix completion

DOI10.1016/J.LAA.2020.04.017MaRDI QIDQ2187387zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 2 June 2020

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.04251

zbMATH Keywords

binary matrix completionlinear programmingrecommender systems

Mathematics Subject Classification ID

Numerical methods for mathematical programming, optimization and variational techniques (65K99)

Recommendations

• The complexity of binary matrix completion under diameter constraints
• Fast deterministic algorithms for matrix completion problems
• Fast deterministic algorithms for matrix completion problems
• Deterministic algorithms for matrix completion
• A Divide-and-Conquer Algorithm for the Bidiagonal SVD
• A subspace-approximating algorithm for matrix completion
• On a Class of Matrix Completion Problems
• An alternating minimization method for matrix completion problems
• Parameterized low-rank binary matrix approximation
• Parameterized low-rank binary matrix approximation

Cites work

• A bound for the number of different basic solutions generated by the simplex method
• A clustering approach to constrained binary matrix factorization
• An alternating direction algorithm for matrix completion with nonnegative factors
• Discovery Science
• Exact matrix completion via convex optimization
• scientific article; zbMATH DE number 6982912 (Why is no real title available?)
• Learning the parts of objects by non-negative matrix factorization
• Low rank matrix completion by alternating steepest descent methods
• Low-rank matrix completion using alternating minimization
• New Finite Pivoting Rules for the Simplex Method
• Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
• Nuclear norm minimization for the planted clique and biclique problems
• The generalized simplex method for minimizing a linear form under linear inequality restraints

Cited in

(1)

• A divide-and-conquer algorithm for binary matrix completion

Describes a project that uses

Uses Software

• ChEMBL
• MovieLens

This page was built for publication: A divide-and-conquer algorithm for binary matrix completion

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