You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@spark.apache.org by ma...@apache.org on 2014/01/22 23:01:57 UTC

[14/50] git commit: doc tweaks

doc tweaks


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

Branch: refs/heads/master
Commit: 53ccf65362d935f89fb9e27b4a3485454fa4c882
Parents: 97dc527
Author: Reza Zadeh <ri...@gmail.com>
Authored: Wed Jan 1 20:03:47 2014 -0800
Committer: Reza Zadeh <ri...@gmail.com>
Committed: Wed Jan 1 20:03:47 2014 -0800

----------------------------------------------------------------------
 docs/mllib-guide.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/incubator-spark/blob/53ccf653/docs/mllib-guide.md
----------------------------------------------------------------------
diff --git a/docs/mllib-guide.md b/docs/mllib-guide.md
index 8c490eb..711187f 100644
--- a/docs/mllib-guide.md
+++ b/docs/mllib-guide.md
@@ -215,7 +215,7 @@ Available algorithms for gradient descent:
 
 # Singular Value Decomposition
 Singular Value Decomposition for Tall and Skinny matrices.
-Given an *m x n* matrix *A*, this will compute matrices *U, S, V* such that
+Given an *m x n* matrix *A*, we can compute matrices *U, S, V* such that
 
 *A = U * S * V^T*