This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Mathematical Formulation Given a matrix M (very sparse) Find a matrix N (full) such that M ( i , j ) = N ( i , j ) ( i , j ) ∈ R Recall that the row rank of a matrix is the number of linearly independent rows The Matrix Completion Problem 3 rows are linearly dependent if one is a linear combination of the other two min rank ( N ) subject to M ( i , j ) = N ( i , j ) ( i , j ) ∈ R N ( i , j ) ≥ Recommendation Systems There are many other such recommendation systems proposed by Amazon, Barnes and Noble, Google, Apple to name just a few. In each instance, we have a partial list about a user's preferences for a few rated items, and would like to predict his/her preferences for all items from this and other information gleaned from many other users....
View
Full
Document
This note was uploaded on 01/15/2012 for the course ECON 101 taught by Professor N/a during the Fall '11 term at Middlesex CC.
 Fall '11
 N/A
 Economics

Click to edit the document details