DeepAI AI Chat
Log In Sign Up

SIMPCA: A framework for rotating and sparsifying principal components

by   Giovanni Maria Merola, et al.

We propose an algorithmic framework for computing sparse components from rotated principal components. This methodology, called SIMPCA, is useful to replace the unreliable practice of ignoring small coefficients of rotated components when interpreting them. The algorithm computes genuinely sparse components by projecting rotated principal components onto subsets of variables. The so simplified components are highly correlated with the corresponding components. By choosing different simplification strategies different sparse solutions can be obtained which can be used to compare alternative interpretations of the principal components. We give some examples of how effective simplified solutions can be achieved with SIMPCA using some publicly available data sets.


page 1

page 2

page 3

page 4


Sparse Principal Components Analysis: a Tutorial

The topic of this tutorial is Least Squares Sparse Principal Components ...

Steerable Principal Components for Space-Frequency Localized Images

This paper describes a fast and accurate method for obtaining steerable ...

Multi-Rank Sparse and Functional PCA: Manifold Optimization and Iterative Deflation Techniques

We consider the problem of estimating multiple principal components usin...

Sensitivity of principal components to changes in the presence of non-stationarity

Non-stationarity affects the sensitivity of change detection in correlat...

Optimal detection of sparse principal components in high dimension

We perform a finite sample analysis of the detection levels for sparse p...

Decomposing an information stream into the principal components

We propose an approach to decomposing a thematic information stream into...

Fast computation of the principal components of genotype matrices in Julia

Finding the largest few principal components of a matrix of genetic data...