Efficient computation of a truncated principal components analysis of a given data matrix
using an implicitly restarted Lanczos method from the irlba
package.The augmented implicitly restarted Lanczos bidiagonalization algorithm (IRLBA) finds a few
approximate largest (or, optionally, smallest) singular values and corresponding singular vectors of a
sparse or dense matrix using a method of Baglama and Reichel. It is a fast and memory-efficient way to
compute a partial SVD.
1 2 | monocle_sparse_prcomp_irlba(x, n = 3, retx = TRUE, center = TRUE,
scale. = FALSE, ...)
|
x |
a numeric or complex matrix (or data frame) which provides the data for the principal components analysis. |
n |
integer number of principal component vectors to return, must be less than
|
retx |
a logical value indicating whether the rotated variables should be returned. |
center |
a logical value indicating whether the variables should be
shifted to be zero centered. Alternately, a centering vector of length
equal the number of columns of |
scale. |
a logical value indicating whether the variables should be
scaled to have unit variance before the analysis takes place.
The default is The value of |
... |
additional arguments passed to |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.