How would you explain Best Rank Approximation to a beginner.
Clash Royale CLAN TAG#URR8PPP
up vote
-1
down vote
favorite
I am including a part of the text here from the Book by HopCroft and Kannan on Data Sciences. This is so that the context is understood
"In particular, this means that the n × d matrix A can be expressed as the product
of an n × k matrix U describing the customers and a k × d matrix V describing the
movies. Finding the best rank k approximation A k by SVD gives such a U and V . One
twist is that A may not be exactly equal to U V , in which case A − U V is treated as
noise"
matrices statistics
add a comment |Â
up vote
-1
down vote
favorite
I am including a part of the text here from the Book by HopCroft and Kannan on Data Sciences. This is so that the context is understood
"In particular, this means that the n × d matrix A can be expressed as the product
of an n × k matrix U describing the customers and a k × d matrix V describing the
movies. Finding the best rank k approximation A k by SVD gives such a U and V . One
twist is that A may not be exactly equal to U V , in which case A − U V is treated as
noise"
matrices statistics
add a comment |Â
up vote
-1
down vote
favorite
up vote
-1
down vote
favorite
I am including a part of the text here from the Book by HopCroft and Kannan on Data Sciences. This is so that the context is understood
"In particular, this means that the n × d matrix A can be expressed as the product
of an n × k matrix U describing the customers and a k × d matrix V describing the
movies. Finding the best rank k approximation A k by SVD gives such a U and V . One
twist is that A may not be exactly equal to U V , in which case A − U V is treated as
noise"
matrices statistics
I am including a part of the text here from the Book by HopCroft and Kannan on Data Sciences. This is so that the context is understood
"In particular, this means that the n × d matrix A can be expressed as the product
of an n × k matrix U describing the customers and a k × d matrix V describing the
movies. Finding the best rank k approximation A k by SVD gives such a U and V . One
twist is that A may not be exactly equal to U V , in which case A − U V is treated as
noise"
matrices statistics
asked Aug 2 at 13:34
Lekhani Ray
1
1
add a comment |Â
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2870066%2fhow-would-you-explain-best-rank-approximation-to-a-beginner%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password