Robust Kernel principal component analysis

59Citations
Citations of this article
548Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This letter discusses the robustness issue of kernel principal component analysis. A class of new robust procedures is proposed based on eigenvalue decomposition of weighted covariance. The proposed procedures will place less weight on deviant patterns and thus be more resistant to data contamination and model deviation. Theoretical influence functions are derived, and numerical examples are presented as well. Both theoretical and numerical results indicate that the proposed robust method outperforms the conventional approach in the sense of being less sensitive to outliers. Our robust method and results also apply to functional principal component analysis. © 2009 Massachusetts Institute of Technology.

Cite

CITATION STYLE

APA

Huang, S. Y., Yeh, Y. R., & Eguchi, S. (2009). Robust Kernel principal component analysis. Neural Computation, 21(11), 3179–3213. https://doi.org/10.1162/neco.2009.02-08-706

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free