资源论文Optimal Mean Robust Principal Component Analysis

Optimal Mean Robust Principal Component Analysis

2020-03-03 | |  63 |   37 |   0

Abstract

Principal Component Analysis (PCA) is the most widely used unsupervised dimensionality reduction approach. In recent research, several robust PCA algorithms were presented to enhance the robustness of PCA model. However, the existing robust PCA methods incorrectly center the data using the 图片.png-norm distance to calculate the mean, which actually is not the optimal mean due to the 图片.png-norm used in the objective functions. In this paper, we propose novel robust PCA objective functions with removing optimal mean automatically. Both theoretical analysis and empirical studies demonstrate our new methods can more effectively reduce data dimensionality than previous robust PCA methods.

上一篇:Topic Modeling using Topics from Many Domains, Lifelong Learning and Big Data

下一篇:Asynchronous Distributed ADMM for Consensus Optimization

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...