The kernel principal component analysis (KPCA) serves as an efficient approach for dimensionality reduction. However, the KPCA method is sensitive to the outliers since the large square errors tend to dominate the loss of KPCA. To strengthen the robustness of KPCA method, we propose a novel robust kernel principal component analysis with optimal mean (RKPCA-OM) method. RKPCA-OM not only possesses stronger robustness for outliers than the conventional KPCA method, but also can eliminate the optimal mean automatically. What is more, the theoretical proof proves the convergence of the algorithm to guarantee that the optimal subspaces and means are obtained. Lastly, exhaustive experimental results verify the superiority of our method. (C) 2022 Elsevier Ltd. All rights reserved.
Key words
Kernel principal component analysis/Robust principal component analysis/Optimal mean
NSTL
Elsevier