Alternative constructor leaving matrix dimensions to be determined automatically.
rows stored as an RDD[Vector]
number of rows. A non-positive value means unknown, and then the number of rows will
be determined by the number of records in the RDD rows
.
number of columns. A non-positive value means unknown, and then the number of columns will be determined by the size of the first row.
Computes column-wise summary statistics.
Computes the covariance matrix, treating each row as an observation.
Computes the covariance matrix, treating each row as an observation.
a local dense matrix of size n x n
Computes the Gramian matrix A^T A
.
Computes the top k principal components.
Computes the top k principal components. Rows correspond to observations and columns correspond to variables. The principal components are stored a local matrix of size n-by-k. Each column corresponds for one principal component, and the columns are in descending order of component variance.
number of top principal components.
a matrix of size n-by-k, whose columns are principal components
Computes the singular value decomposition of this matrix.
Computes the singular value decomposition of this matrix. Denote this matrix by A (m x n), this will compute matrices U, S, V such that A = U * S * V'.
There is no restriction on m, but we require n^2
doubles to fit in memory.
Further, n should be less than m.
The decomposition is computed by first computing A'A = V S2 V',
computing svd locally on that (since n x n is small), from which we recover S and V.
Then we compute U via easy matrix multiplication as U = A * (V * S-1).
Note that this approach requires O(n^3)
time on the master node.
At most k largest non-zero singular values and associated vectors are returned. If there are k such values, then the dimensions of the return will be:
U is a RowMatrix of size m x k that satisfies U'U = eye(k), s is a Vector of size k, holding the singular values in descending order, and V is a Matrix of size n x k that satisfies V'V = eye(k).
number of singular values to keep. We might return less than k if there are numerically zero singular values. See rCond.
whether to compute U
the reciprocal condition number. All singular values smaller than rCond * sigma(0) are treated as zero, where sigma(0) is the largest singular value.
SingularValueDecomposition(U, s, V)
Multiply this matrix by a local matrix on the right.
Multiply this matrix by a local matrix on the right.
a local matrix whose number of rows must match the number of columns of this matrix
a org.apache.spark.mllib.linalg.distributed.RowMatrix representing the product, which preserves partitioning
Gets or computes the number of columns.
Gets or computes the number of columns.
Gets or computes the number of rows.
Gets or computes the number of rows.
rows stored as an RDD[Vector]
:: Experimental :: Represents a row-oriented distributed Matrix with no meaningful row indices.