Robust principal component analysis via ES-algorithm |
| |
Institution: | 1. Department of Statistics, Seoul National University, Seoul 151-747, Republic of Korea;2. Department of Statistics, University of Illinois at Urbana-Champaign, Champaign, IL 61820, USA |
| |
Abstract: | In this paper, a new method for robust principal component analysis (PCA) is proposed. PCA is a widely used tool for dimension reduction without substantial loss of information. However, the classical PCA is vulnerable to outliers due to its dependence on the empirical covariance matrix. To avoid such weakness, several alternative approaches based on robust scatter matrix were suggested. A popular choice is ROBPCA that combines projection pursuit ideas with robust covariance estimation via variance maximization criterion. Our approach is based on the fact that PCA can be formulated as a regression-type optimization problem, which is the main difference from the previous approaches. The proposed robust PCA is derived by substituting square loss function with a robust penalty function, Huber loss function. A practical algorithm is proposed in order to implement an optimization computation, and furthermore, convergence properties of the algorithm are investigated. Results from a simulation study and a real data example demonstrate the promising empirical properties of the proposed method. |
| |
Keywords: | ES-algorithm Principal component analysis Pseudo data Robustness |
本文献已被 ScienceDirect 等数据库收录! |
|