Targeted matrix completion

Natali Ruchansky
Natali Ruchansky

SDM, 2017.

Cited by: 2|Bibtex|Views41
EI
Other Links: dblp.uni-trier.de|arxiv.org

Abstract:

Matrix completion is a problem that arises in many data-analysis settings where the input consists of a partially-observed matrix (e.g., recommender systems, traffic matrix analysis etc.). Classical approaches to matrix completion assume that the input partially-observed matrix is low rank. The success of these methods depends on the nu...More

Code:

Data:

Your rating :
0

 

Tags
Comments