You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@mahout.apache.org by dl...@apache.org on 2014/03/11 17:54:24 UTC

svn commit: r1576423 - /mahout/site/mahout_cms/trunk/content/users/dim-reduction/ssvd.mdtext

Author: dlyubimov
Date: Tue Mar 11 16:54:23 2014
New Revision: 1576423

URL: http://svn.apache.org/r1576423
Log:
CMS commit to mahout by dlyubimov

Modified:
    mahout/site/mahout_cms/trunk/content/users/dim-reduction/ssvd.mdtext

Modified: mahout/site/mahout_cms/trunk/content/users/dim-reduction/ssvd.mdtext
URL: http://svn.apache.org/viewvc/mahout/site/mahout_cms/trunk/content/users/dim-reduction/ssvd.mdtext?rev=1576423&r1=1576422&r2=1576423&view=diff
==============================================================================
--- mahout/site/mahout_cms/trunk/content/users/dim-reduction/ssvd.mdtext (original)
+++ mahout/site/mahout_cms/trunk/content/users/dim-reduction/ssvd.mdtext Tue Mar 11 16:54:23 2014
@@ -50,6 +50,8 @@ Note: Please use 0.6 or later! for PCA w
 [Nathan Halko's dissertation][1] "Randomized methods for computing low-rank
 approximations of matrices" contains comprehensive definition of parallelization strategy taken in Mahout SSVD implementation and also some precision/scalability benchmarks, esp. w.r.t. Mahout Lanczos implementation on a typical corpus data set.
 
+[Halko, Martinsson, Tropp] paper discusses family of random projection-based algorithms and contains theoretical error estimates.
+
 **R simulation**
 
 [Non-parallel SSVD simulation in R][2] with power iterations and PCA options. Note that this implementation is not most optimal for sequential flow solver, but it is for demonstration purposes only.