Two Proposals for Robust PCA using Semidefinite Programming

Details Two Proposals for Robust PCA using Semidefinite Programming Two Proposals for Robust PCA using Semidefinite Programming

2010-12-06

arxiv.org/abs/1012.1086v3

Statistics

Computation

Scientific paper

The performance of principal component analysis (PCA) suffers badly in the presence of outliers. This paper proposes two novel approaches for robust PCA based on semidefinite programming. The first method, maximum mean absolute deviation rounding (MDR), seeks directions of large spread in the data while damping the effect of outliers. The second method produces a low-leverage decomposition (LLD) of the data that attempts to form a low-rank model for the data by separating out corrupted observations. This paper also presents efficient computational methods for solving these SDPs. Numerical experiments confirm the value of these new techniques.

Affiliated with

Also associated with

No associations

Rating

Two Proposals for Robust PCA using Semidefinite Programming 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 Two Proposals for Robust PCA using Semidefinite Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two Proposals for Robust PCA using Semidefinite Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-167285