z-logo
open-access-imgOpen Access
Algorithms for Projection-Pursuit Robust Principal Component Analysis
Author(s) -
Christophe Croux,
Peter Filzmoser,
M. Rosário Oliveira
Publication year - 2006
Publication title -
ssrn electronic journal
Language(s) - English
Resource type - Journals
ISSN - 1556-5068
DOI - 10.2139/ssrn.968376
Subject(s) - principal component analysis , projection pursuit , robust principal component analysis , computer science , projection (relational algebra) , component (thermodynamics) , artificial intelligence , pattern recognition (psychology) , algorithm , physics , thermodynamics
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 has recently been introduced in the field of chemometrics, where the number of variables is typically large. In this paper, it is shown that the currently available algorithm for robust Projection-Pursuit PCA performs poor in presence of many variables. A new algorithm is proposed that is more suitable for the analysis of chemical data. Its performance is studied by means of simulation experiments and illustrated on some real datasets.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom