Difference between revisions of "Singular value decomposition"
Jump to navigation
Jump to search
| Line 9: | Line 9: | ||
== SVD as Matrix Factorization == | == SVD as Matrix Factorization == | ||
Please refer to [[Matrix factorization]] | Please refer to [[Matrix factorization]] | ||
| + | |||
| + | == See Also == | ||
| + | * [[SVD++]] is a generalization of matrix factorization to make use of implicit feedback. | ||
Revision as of 22:02, 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(LSI) in IR.
- Wikipedia page about SVD: http://en.wikipedia.org/wiki/Singular_value_decomposition
- Wikipedia page about LSI: http://en.wikipedia.org/wiki/Latent_semantic_indexing
SVD as Matrix Factorization
Please refer to Matrix factorization
See Also
- SVD++ is a generalization of matrix factorization to make use of implicit feedback.
