You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@mahout.apache.org by bu...@apache.org on 2014/03/10 05:45:37 UTC
svn commit: r900831 - in /websites/staging/mahout/trunk/content: ./
users/dim-reduction/ssvd.html
Author: buildbot
Date: Mon Mar 10 04:45:36 2014
New Revision: 900831
Log:
Staging update by buildbot for mahout
Modified:
websites/staging/mahout/trunk/content/ (props changed)
websites/staging/mahout/trunk/content/users/dim-reduction/ssvd.html
Propchange: websites/staging/mahout/trunk/content/
------------------------------------------------------------------------------
--- cms:source-revision (original)
+++ cms:source-revision Mon Mar 10 04:45:36 2014
@@ -1 +1 @@
-1575818
+1575819
Modified: websites/staging/mahout/trunk/content/users/dim-reduction/ssvd.html
==============================================================================
--- websites/staging/mahout/trunk/content/users/dim-reduction/ssvd.html (original)
+++ websites/staging/mahout/trunk/content/users/dim-reduction/ssvd.html Mon Mar 10 04:45:36 2014
@@ -258,7 +258,7 @@ x<span class="o"><-</span> usim <span
<h4 id="modified-ssvd-algorithm">Modified SSVD Algorithm.</h4>
<p>Given an (m\times n)
matrix (\mathbb{A}), a target rank \(k\in\mathbb{N}<em>{1})
-, an oversampling parameter <code>\(p\in\mathbb{N}_{1}\)</code>,
+, an oversampling parameter \(p\in\mathbb{N}_{1}\),
and the number of additional power iterations (q\in\mathbb{N}</em>{0}),
this procedure computes an (m\times\left(k+p\right))
SVD (\mathbf{A\approx U}\boldsymbol{\Sigma}\mathbf{V}^{\top}):</p>