Difference between revisions of "Singular value decomposition"
Jump to navigation
Jump to search
(Created page with "'''SVD''' refers to singular value decomposition in linear algebra. However, in the field of collaborative filtering, '''SVD''' often means Matrix factorization. == SVD in M...") |
|||
| Line 4: | Line 4: | ||
The traditional '''SVD''' can also be used as collaborative filtering algorithm. It's also named Latent Semantic Indexing in IR. | The traditional '''SVD''' can also be used as collaborative filtering algorithm. It's also named Latent Semantic Indexing in IR. | ||
| − | * [ http://en.wikipedia.org/wiki/Singular_value_decomposition ] | + | * [http://en.wikipedia.org/wiki/Singular_value_decomposition] |
| − | * [ http://en.wikipedia.org/wiki/Latent_semantic_indexing ] | + | * [http://en.wikipedia.org/wiki/Latent_semantic_indexing] |
| + | |||
== Matrix Factorization == | == Matrix Factorization == | ||
Please refer to [[Matrix factorization]] | Please refer to [[Matrix factorization]] | ||
Revision as of 21:59, 11 November 2011
SVD refers to singular value decomposition in linear algebra. However, in the field of collaborative filtering, SVD often means Matrix factorization.
SVD in Math
The traditional SVD can also be used as collaborative filtering algorithm. It's also named Latent Semantic Indexing in IR.
Matrix Factorization
Please refer to Matrix factorization
