[34/50] git commit: documentation for sparsematrix

[ma...@apache.org]

documentation for sparsematrix


Project: http://git-wip-us.apache.org/repos/asf/incubator-spark/repo
Commit: http://git-wip-us.apache.org/repos/asf/incubator-spark/commit/4f38b6fa
Tree: http://git-wip-us.apache.org/repos/asf/incubator-spark/tree/4f38b6fa
Diff: http://git-wip-us.apache.org/repos/asf/incubator-spark/diff/4f38b6fa

Branch: refs/heads/master
Commit: 4f38b6fab5bf633a205b9039db9d4a26ed28ec89
Parents: 7d7490b
Author: Reza Zadeh <ri...@gmail.com>
Authored: Tue Jan 7 17:19:28 2014 -0800
Committer: Reza Zadeh <ri...@gmail.com>
Committed: Tue Jan 7 17:19:28 2014 -0800

----------------------------------------------------------------------
 docs/mllib-guide.md | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/incubator-spark/blob/4f38b6fa/docs/mllib-guide.md
----------------------------------------------------------------------
diff --git a/docs/mllib-guide.md b/docs/mllib-guide.md
index 653848b..44e6c8f 100644
--- a/docs/mllib-guide.md
+++ b/docs/mllib-guide.md
@@ -228,8 +228,8 @@ from which we recover S and V.
 Then we compute U via easy matrix multiplication
 as *U =  A * V * S^-1*
  
-Only singular vectors associated with singular values
-greater or equal to MIN_SVALUE are recovered. If there are k
+Only singular vectors associated with largest k singular values
+are recovered. If there are k
 such values, then the dimensions of the return will be:
 
 * *S* is *k x k* and diagonal, holding the singular values on diagonal.
@@ -237,7 +237,8 @@ such values, then the dimensions of the return will be:
 * *V* is *n x k* and satisfies V^TV = eye(k).
 
 All input and output is expected in sparse matrix format, 1-indexed
-as tuples of the form ((i,j),value) all in RDDs. Below is example usage.
+as tuples of the form ((i,j),value) all in 
+SparseMatrix RDDs. Below is example usage.
 
 {% highlight scala %}