Principal Component Analysis with Contaminated Data: The High Dimensional Case

Details Principal Component Analysis with Contaminated Data: The High Dimensional Case Principal Component Analysis with Contaminated Data: The High Dimensional Case

2010-02-24

arxiv.org/abs/1002.4658v2

Statistics

Machine Learning

Scientific paper

We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of observations is of the same magnitude as the number of variables of each observation, and the data set contains some (arbitrarily) corrupted observations. We propose a High-dimensional Robust Principal Component Analysis (HR-PCA) algorithm that is tractable, robust to contaminated points, and easily kernelizable. The resulting subspace has a bounded deviation from the desired one, achieves maximal robustness -- a breakdown point of 50% while all existing algorithms have a breakdown point of zero, and unlike ordinary PCA algorithms, achieves optimality in the limit case where the proportion of corrupted points goes to zero.

Affiliated with

Also associated with

No associations

Rating

Principal Component Analysis with Contaminated Data: The High Dimensional Case does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Principal Component Analysis with Contaminated Data: The High Dimensional Case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Principal Component Analysis with Contaminated Data: The High Dimensional Case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-379003