Pith. sign in

REVIEW

Sparse Principal Components Analysis: a Tutorial

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.13581 v1 pith:IB2KTIME submitted 2021-05-28 stat.ME

classification stat.ME
keywords componentsspcaprincipalsparseanalysiscomputingtutorialanalogously
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The topic of this tutorial is Least Squares Sparse Principal Components Analysis (LS SPCA) which is a simple method for computing approximated Principal Components which are combinations of only a few of the observed variables. Analogously to Principal Components, these components are uncorrelated and sequentially best approximate the dataset. The derivation of LS SPCA is intuitive for anyone familiar with linear regression. Since LS SPCA is based on a different optimality from other SPCA methods and does not suffer from their serious drawbacks. I will demonstrate on two datasets how useful and parsimonious sparse PCs can be computed. An R package for computing LS SPCA is available for download.

Discussion (0). Continue with ORCID to comment.

Pith tools