Singular value decomposition - Revision history

Zeno Gantner at 11:47, 15 February 2013

2013-02-15T11:47:32Z

Zeno Gantner: moved SVD to Singular value decomposition

2011-11-12T09:50:30Z

moved SVD to Singular value decomposition

Zeno Gantner at 09:49, 12 November 2011

2011-11-12T09:49:57Z

Tqchen at 07:37, 12 November 2011

2011-11-12T07:37:29Z

Tqchen at 02:02, 12 November 2011

2011-11-12T02:02:15Z

Tqchen: /* Matrix Factorization */

2011-11-12T02:00:54Z

Matrix Factorization

Tqchen: /* SVD in Math */

2011-11-12T02:00:26Z

SVD in Math

Tqchen: /* SVD in Math */

2011-11-12T01:59:12Z

SVD in Math

Tqchen: 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..."

2011-11-12T01:58:45Z

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..."

New page

'''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.

* [ http://en.wikipedia.org/wiki/Singular_value_decomposition ]
* [ http://en.wikipedia.org/wiki/Latent_semantic_indexing ]
== Matrix Factorization ==
Please refer to [[Matrix factorization]]

@@ 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 ==
@@ Line 5: / Line 5: @@
 It is also named '''latent semantic indexing''' ('''LSI''') in [[information retrieval]].
-== SVD as Matrix Factorization ==
+== See also ==
-Please refer to [[Matrix factorization]]
+* [[SVD++]] is a generalization of matrix factorization to make use of [[implicit feedback]].
 == External links ==
 * [[Wikipedia: Singular value decomposition]]
 * [[Wikipedia: Latent semantic indexing]]
 [[Category: Method]]

@@ 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, 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.
+The traditional SVD can also be used as collaborative filtering algorithm.
+It is also named '''latent semantic indexing''' ('''LSI''') in [[information retrieval]].
 == SVD as Matrix Factorization ==
@@ Line 13: / Line 11: @@
 * [[SVD++]] is a generalization of matrix factorization to make use of implicit feedback.
-[[Category:Method]]
+== External links ==

← Older revision		Revision as of 07:37, 12 November 2011
Line 12:		Line 12:
	== See Also ==		== See Also ==
	* [[SVD++]] is a generalization of matrix factorization to make use of implicit feedback.		* [[SVD++]] is a generalization of matrix factorization to make use of implicit feedback.
		+
		+	[[Category:Method]]

← Older revision		Revision as of 02:02, 12 November 2011
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.

@@ Line 7: / Line 7: @@
 * Wikipedia page about LSI: http://en.wikipedia.org/wiki/Latent_semantic_indexing
-== Matrix Factorization ==
+== SVD as Matrix Factorization ==
 Please refer to [[Matrix factorization]]

@@ Line 4: / Line 4: @@
 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 ==
 Please refer to [[Matrix factorization]]