Sparse Principal Component Analysis

Fits principal components with sparse loading vectors for interpretable dimension reduction. Variable projection combines an orthogonal reconstruction factor with elastic net or cardinality regularization of the loadings. Deterministic, randomized, and robust algorithms support exploratory analysis of high-dimensional data; the randomized algorithm also supports sparse input matrices through implicit centering and scaling. A robust formulation separates entrywise outliers from the low-rank reconstruction. Regularization paths and approximate feature-count searches reuse matrix factorizations, and prediction applies the fitted transformation to new observations. The methods are described in Erichson et al. (2020) .


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("sparsepca")

1.0.0 by N. Benjamin Erichson, 5 days ago


https://github.com/erichson/spca


Report a bug at https://github.com/erichson/spca/issues


Browse source code at https://github.com/cran/sparsepca


Authors: N. Benjamin Erichson [aut, cre] , Peng Zheng [aut] , Sasha Aravkin [aut] , Maria A. Sans-Fuentes [ctb] (ORCID: , Reported the robust objective error)


Documentation:   PDF Manual  


GPL (>= 3) license


Imports Matrix, methods, rsvd

Suggests testthat


Imported by SparseBiplots, categoryEncodings, clusterability, robCompositions.

Suggested by parameters, ptLasso.


See at CRAN