Description Usage Arguments Value References Examples
This is simply an alternative to R's principal and prcomp functions that uses expectation
maximization to fit the PCA in the presence of missing values. If there are no missing values the output
should be virtually identical to the pca
function, save for sign changes in the eigenvectors
and loadings, and small numerical differences. The 'sensible principal components analysis' EM
algorithm described by Rowels (1997) is implemented here. It is simply a variant of Tipping & Bishop's (1997)
EM algorithm.
1 2 3 4 5 6 7 |
x |
a matrix or data frame containing only numeric variables |
ncomp |
the number of components to retain. |
scale |
should the variables be scaled prior to analysis? Defaults to TRUE. |
maxit |
maximum number of iterations for expectation maximization. defaults to 1000. |
tol |
tolerance for convergence. defaults to 1e-4. |
an object of class PrincipalComp
Tipping, M. & Bishop, C. Probabilistic principal component analysis. Technical
Report NCRG/97/010, Neural Computing Research Group, Aston University, September 1997.
Rowels, S.(1997) EM algorithms for PCA and SPCA. NIPS'97: Proceedings of the 10th International
Conference on Neural Information Processing Systems
1 | ppca(x, 3)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.