Difference between revisions of "Singular value decomposition"

From RecSysWiki
Jump to navigation Jump to search
 
(4 intermediate revisions by 2 users not shown)
Line 1: Line 1:
'''SVD''' refers to singular value decomposition in linear algebra. However, in the field of collaborative filtering, '''SVD''' often means [[Matrix factorization]].
+
'''SVD''' refers to '''singular value decomposition''' in [[linear algebra]]. However, in the field of [[collaborative filtering]], the term "SVD" often refers to [[matrix factorization]].
  
 
== SVD in Math ==
 
== SVD in Math ==
The traditional '''SVD''' can also be used as collaborative filtering algorithm. It's also named Latent Semantic Indexing(LSI) in IR.
+
The traditional SVD can also be used as collaborative filtering algorithm.
 +
It is also named '''latent semantic indexing''' ('''LSI''') in [[information retrieval]].
  
* Wikipedia page about SVD: http://en.wikipedia.org/wiki/Singular_value_decomposition
+
== See also ==
* Wikipedia page about LSI: http://en.wikipedia.org/wiki/Latent_semantic_indexing
+
* [[SVD++]] is a generalization of matrix factorization to make use of [[implicit feedback]].
  
== SVD as Matrix Factorization ==
+
== External links ==
Please refer to [[Matrix factorization]]
+
* [[Wikipedia: Singular value decomposition]]
 +
* [[Wikipedia: Latent semantic indexing]]
 +
* [http://thatsmaths.com/2013/02/14/singularly-valuable-svd/ Singularly Valuable SVD]
 +
 
 +
[[Category: Method]]

Latest revision as of 06:47, 15 February 2013

SVD refers to singular value decomposition in linear algebra. However, in the field of collaborative filtering, the term "SVD" often refers to matrix factorization.

SVD in Math

The traditional SVD can also be used as collaborative filtering algorithm. It is also named latent semantic indexing (LSI) in information retrieval.

See also

External links