Sparse Principal Component Analysis

  title={Sparse Principal Component Analysis},
  author={Hui Zou and Trevor J. Hastie and Robert Tibshirani},
  journal={Journal of Computational and Graphical Statistics},
  pages={265 - 286}
Principal component analysis (PCA) is widely used in data processing and dimensionality reduction. However, PCA suffers from the fact that each principal component is a linear combination of all the original variables, thus it is often difficult to interpret the results. We introduce a new method called sparse principal component analysis (SPCA) using the lasso (elastic net) to produce modified principal components with sparse loadings. We first show that PCA can be formulated as a regression… Expand
Hierarchically penalized sparse principal component analysis
A new PCA method is proposed to improve variable selection performance when variables are grouped, which not only selects important groups but also removes unimportant variables within identified groups to incorporate group information into model fitting. Expand
Sparse principal component analysis via regularized low rank matrix approximation
Principal component analysis (PCA) is a widely used tool for data analysis and dimension reduction in applications throughout science and engineering. However, the principal components (PCs) canExpand
Projection Sparse Principal Component Analysis: an efficient method for improving the interpretation of principal components
Sparse principal components analysis (SPCA) methods approximate principal components with combinations of few of the observed variables. Sparse components are more interpretable than standardExpand
Stochastic convex sparse principal component analysis
A convex sparse principal component analysis (Cvx-SPCA), which leverages a proximal variance reduced stochastic scheme to achieve a geometric convergence rate and it is shown that the convergence analysis can be significantly simplified by using a weak condition which allows a broader class of objectives to be applied. Expand
Robust Sparse Principal Component Analysis
The method is applied on several real data examples, and diagnostic plots for detecting outliers and for selecting the degree of sparsity are provided, and an algorithm to compute the sparse and robust principal components is proposed. Expand
Sparse Principal Component Analysis Based on Least Trimmed Squares
A robust sparsePCA method is proposed to handle potential outliers in the data based on the least trimmed squares PCA method which provides robust but non-sparse PC estimates and the computation time is reduced to a great extent. Expand
Sparse Principal Component Analysis Incorporating Stability Selection
Principal component analysis (PCA) is a popular dimension reduction method that approximates a numerical data matrix by seeking principal components (PC), i.e. linear combinations of variables thatExpand
Sparse principal component regression with adaptive loading
The sparse principal component regression (SPCR) is proposed that is a one-stage procedure for PCR that enables us to adaptively obtain sparse principal components loadings that are related to the response variable and select the number of principal components simultaneously. Expand
Sparse Principal Component Analysis via Joint L2,1-Norm Penalty
Sparse principal component analysis (SPCA) is a popular method to get the sparse loadings of principal component analysis(PCA), it represents PCA as a regression model by using lasso constraint, butExpand
Sparse Principal Component Analysis: a Least Squares approximation approach
Sparse Principal Components Analysis aims to find principal components with few non-zero loadings. We derive such sparse solutions by adding a genuine sparsity requirement to the original PrincipalExpand


A Modified Principal Component Technique Based on the LASSO
In many multivariate statistical techniques, a set of linear functions of the original p variables is produced. One of the more difficult aspects of these techniques is the interpretation of theExpand
Simple principal components
Summary. We introduce an algorithm for producing simple approximate principal components directly from a variance-covariance matrix. At the heart of the algorithm is a series of 'simplicityExpand
Principal Component Analysis
Introduction * Properties of Population Principal Components * Properties of Sample Principal Components * Interpreting Principal Components: Examples * Graphical Representation of Data UsingExpand
Regression Shrinkage and Selection via the Elastic Net , with Applications to Microarrays
We propose the elastic net, a new regression shrinkage and selection method. Real data and a simulation study show that the elastic net often outperforms the lasso, while it enjoys a similar sparsityExpand
Regression Shrinkage and Selection via the Lasso
SUMMARY We propose a new method for estimation in linear models. The 'lasso' minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than aExpand
Rotation of principal components: choice of normalization constraints
Following a principal component analysis, it is fairly common practice to rotate some of the components, often using orthogonal rotation. It is a frequent misconception that orthogonal rotation willExpand
Regularization and variable selection via the elastic net
Summary. We propose the elastic net, a new regularization and variable selection method. Real world data and a simulation study show that the elastic net often outperforms the lasso, while enjoying aExpand
A new approach to variable selection in least squares problems
The title Lasso has been suggested by Tibshirani (1996) as a colourful name for a technique of variable selection which requires the minimization of a sum of squares subject to an l 1 bound κ on theExpand
Interactive exploration of microarray gene expression patterns in a reduced dimensional space.
In this study, PCA projection facilitated discriminatory gene selection for different tissues and identified tissue-specific gene expression signatures for liver, skeletal muscle, and brain samples. Expand
Singular value decomposition for genome-wide expression data processing and modeling.
Using singular value decomposition in transforming genome-wide expression data from genes x arrays space to reduced diagonalized "eigengenes" x "eigenarrays" space gives a global picture of the dynamics of gene expression, in which individual genes and arrays appear to be classified into groups of similar regulation and function, or similar cellular state and biological phenotype. Expand