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 2015/03/28 01:25:42 UTC
svn commit: r945336 - in /websites/staging/mahout/trunk/content: ./
users/algorithms/d-ssvd.html
Author: buildbot
Date: Sat Mar 28 00:25:42 2015
New Revision: 945336
Log:
Staging update by buildbot for mahout
Modified:
websites/staging/mahout/trunk/content/ (props changed)
websites/staging/mahout/trunk/content/users/algorithms/d-ssvd.html
Propchange: websites/staging/mahout/trunk/content/
------------------------------------------------------------------------------
--- cms:source-revision (original)
+++ cms:source-revision Sat Mar 28 00:25:42 2015
@@ -1 +1 @@
-1669711
+1669720
Modified: websites/staging/mahout/trunk/content/users/algorithms/d-ssvd.html
==============================================================================
--- websites/staging/mahout/trunk/content/users/algorithms/d-ssvd.html (original)
+++ websites/staging/mahout/trunk/content/users/algorithms/d-ssvd.html Sat Mar 28 00:25:42 2015
@@ -253,7 +253,7 @@
<div id="main">
<h1 id="distributed-stochastic-singular-value-decomposition">Distributed Stochastic Singular Value Decomposition</h1>
<h2 id="intro">Intro</h2>
-<p>Mahout has a distributed implementation of Stochastic Singular Value Decomposition [1].</p>
+<p>Mahout has a distributed implementation of Stochastic Singular Value Decomposition [1] using the parallelization strategy comprehensively defined in Nathan Halko's dissertation <a href="http://amath.colorado.edu/faculty/martinss/Pubs/2012_halko_dissertation.pdf">"Randomized methods for computing low-rank approximations of matrices"</a> [2].</p>
<h2 id="modified-ssvd-algorithm">Modified SSVD Algorithm</h2>
<p>Given an <code>\(m\times n\)</code>
matrix <code>\(\mathbf{A}\)</code>, a target rank <code>\(k\in\mathbb{N}_{1}\)</code>
@@ -375,10 +375,10 @@ Another way is <code>\(\mathbf{V}=\mathb
<h2 id="references">References</h2>
<p>[1]: <a href="http://mahout.apache.org/users/sparkbindings/ScalaSparkBindings.pdf">Mahout Scala and Mahout Spark Bindings for Linear Algebra Subroutines</a></p>
+<p>[2]: <a href="http://amath.colorado.edu/faculty/martinss/Pubs/2012_halko_dissertation.pdf">Randomized methods for computing low-rank
+approximations of matrices</a></p>
<p>[2]: <a href="http://arxiv.org/abs/0909.4061">Halko, Martinsson, Tropp</a></p>
<p>[3]: <a href="http://mahout.apache.org/users/sparkbindings/home.html">Mahout Spark and Scala Bindings</a></p>
-<p>[4]: <a href="http://amath.colorado.edu/faculty/martinss/Pubs/2012_halko_dissertation.pdf">Randomized methods for computing low-rank
-approximations of matrices</a></p>
</div>
</div>
</div>