ROBPCA: A New Approach to Robust Principal Component Analysis

@article{Hubert2005ROBPCAAN,
  title={ROBPCA: A New Approach to Robust Principal Component Analysis},
  author={Mia Hubert and Peter J. Rousseeuw and Karlien Vanden Branden},
  journal={Technometrics},
  year={2005},
  volume={47},
  pages={64 - 79}
}
We introduce a new method for robust principal component analysis (PCA). Classical PCA is based on the empirical covariance matrix of the data and hence is highly sensitive to outlying observations. Two robust approaches have been developed to date. The first approach is based on the eigenvectors of a robust scatter matrix such as the minimum covariance determinant or an S-estimator and is limited to relatively low-dimensional data. The second approach is based on projection pursuit and can… 

Robust PCA and classification in biosciences

A robust PCA (ROBPCA) method is proposed that combines projection-pursuit ideas with robust estimation of low-dimensional data and shows that this combination of robust methods leads to better classifications than classical PCA and quadratic discriminant analysis.

Chapter 34 The New Measure of Robust Principal Component Analysis

This paper proposes PCA using the minimum vec- tor variance (MVV) as new measure of robust PCA to enhance the result.

The New Measure of Robust Principal Component Analysis

This paper proposes PCA using the minimum vector variance (MVV) as new measure of robust PCA to enhance the result.

S-Estimators for Functional Principal Component Analysis

Principal component analysis is a widely used technique that provides an optimal lower-dimensional approximation to multivariate or functional datasets. These approximations can be very useful in

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.

The Robust Principal Component Using Minimum Vector Variance

This paper discusses PCA using the minimum vector variance (MVV) to enhance the result, and suggests that the usefulness of MVV is not limited to small or low dimension data set and to non-singular or singular covariance matrix.

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.

Algorithms for Projection-Pursuit Robust Principal Component Analysis

Principal Component Analysis (PCA) is very sensitive in presence of outliers. One of the most appealing robust methods for principal component analysis uses the Projection-Pursuit principle. Here,

Robust and Sparse Kernel PCA and Its Outlier Map

A two-stage algorithm was proposed: a robust distance was computed to identify the uncontaminated data set, followed by estimating the best-fit ellipsoid to these data for an informative and concise representation, and a kernel PCA outlier map was proposed to display and classify the outliers.
...

References

SHOWING 1-10 OF 34 REFERENCES

Robust PCA and classification in biosciences

A robust PCA (ROBPCA) method is proposed that combines projection-pursuit ideas with robust estimation of low-dimensional data and shows that this combination of robust methods leads to better classifications than classical PCA and quadratic discriminant analysis.

Fast cross-validation in robust PCA

This paper introduces faster algorithms to compute the cross-validated PRESS value for robust PCA methods such as the LTS estimator and robust PLS regression and extent the methodology to high-breakdown regression methods.

A robust PCR method for high‐dimensional regressors

We consider the multivariate calibration model which assumes that the concentrations of several constituents of a sample are linearly related to its spectrum. Principal component regression (PCR) is

Fast and robust discriminant analysis

Robust methods for partial least squares regression

Partial least squares regression (PLSR) is a linear regression technique developed to deal with high‐dimensional regressors and one or several response variables. In this paper we introduce

A Fast Algorithm for the Minimum Covariance Determinant Estimator

For small datasets, FAST-MCD typically finds the exact MCD, whereas for larger datasets it gives more accurate results than existing algorithms and is faster by orders.

The kernel PCA algorithms for wide data. Part I: Theory and algorithms

LIBRA: a MATLAB library for robust analysis

Projection-Pursuit Approach to Robust Dispersion Matrices and Principal Components: Primary Theory and Monte Carlo

Abstract This article proposes and discusses a type of new robust estimators for covariance/correlation matrices and principal components via projection-pursuit techniques. The most attractive