Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Kernel PCA pattern reconstruction via approximate pre-images.

There are no MPG-Authors in the publication available
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Schölkopf, B., Mika, S., Smola, A., Rätsch, G., & Müller, K.-R. (1998). Kernel PCA pattern reconstruction via approximate pre-images. In L. Niklasson, M. Bodén, & T. Ziemke (Eds.), ICANN 98: 8th International Conference on Artificial Neural Networks, Skövde, Sweden, 2–4 September 1998 (pp. 147-152). London, UK: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-E954-E
Algorithms based on Mercer kernels construct their solutions in terms of expansions in a high-dimensional feature space F. Previous work has shown that all algorithms which can be formulated in terms of dot products in F can be performed using a kernel without explicitly working in F. The list of such algorithms includes support vector machines and nonlinear kernel principal component extraction. So far, however, it did not include the reconstruction of patterns from their largest nonlinear principal components, a technique which is common practice in linear principal component analysis.

The present work proposes an idea for approximately performing this task. As an illustrative example, an application to the de-noising of data clusters is presented.