Robust Principal Component Analysis by Projection Pursuit
نویسندگان
چکیده
Different algorithms for principal component analysis (PCA) based on the idea of projection pursuit are proposed. We show how the algorithms are constructed, and compare the new algorithms with standard algorithms. With the R implementation pcaPP we demonstrate the usefulness at real data examples. Finally, it will be outlined how the algorithms can be used for robustifying other multivariate methods.
منابع مشابه
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, one projects the data on a lower-dimensional space such that a robust measure of variance of the projected data will be maximized. The Projection-Pursuit based method for principal component analysis ...
متن کاملRobust Functional Principal Components : a Projection - Pursuit Approach
In many situations, data are recorded over a period of time and may be regarded as realizations of a stochastic process. In this paper, robust estimators for the principal components are considered by adapting the projection pursuit approach to the functional data setting. Our approach combines robust projection–pursuit with different smoothing methods. Consistency of the estimators are shown u...
متن کاملROBPCA: A New Approach to Robust Principal Component Analysis
In this paper we introduce a new method for robust principal component analysis. Classical PCA is based on the empirical covariance matrix of the data and hence it is highly sensitive to outlying observations. In the past, two robust approaches have been developed. The first is based on the eigenvectors of a robust scatter matrix such as the MCD or an S-estimator, and is limited to relatively l...
متن کاملA Characterization of Principal Components for Projection Pursuit
Principal Component Analysis is a technique often found to be useful for identifying structure in multivariate data. Although it has various characterizations (Rao 1964), the most familiar is as a variance-maximizing projection. Projection pursuit is a methodology for selecting low-dimensional projections of multivariate data by the optimization of some index of \interestingness" over all proje...
متن کاملRobust PCA: Optimization of the Robust Reconstruction Error Over the Stiefel Manifold
Abstract. It is well known that Principal Component Analysis (PCA) is strongly affected by outliers and a lot of effort has been put into robustification of PCA. In this paper we present a new algorithm for robust PCA minimizing the trimmed reconstruction error. By directly minimizing over the Stiefel manifold, we avoid deflation as often used by projection pursuit methods. In distinction to ot...
متن کامل