z-logo
open-access-imgOpen Access
High Rank Matrix Completion With Side Information
Author(s) -
Yugang Wang,
Ehsan Elhamifar
Publication year - 2018
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v32i1.11809
Subject(s) - matrix completion , sparse matrix , matrix (chemical analysis) , rank (graph theory) , matrix decomposition , low rank approximation , computer science , algorithm , convex optimization , representation (politics) , relaxation (psychology) , data matrix , sparse approximation , mathematics , theoretical computer science , regular polygon , combinatorics , materials science , law , mathematical analysis , chemistry , composite material , psychology , social psychology , biochemistry , geometry , quantum mechanics , political science , gaussian , clade , eigenvalues and eigenvectors , physics , hankel matrix , politics , gene , phylogenetic tree

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom