Kernel Principal Component Analysis Action Set

KPCA Mapping Pre-image Method

The pre-image map method was first proposed by Bakir, Weston, and Schölkopf (2003). The objective is to learn the pre-image map of the form

where upper P Subscript k is the KPCA projection operator with kernel function k, m is the number of features of the training data set, bold upper Gamma Subscript j Baseline left-parenthesis upper P Subscript k Baseline phi left-parenthesis x right-parenthesis right-parenthesis equals sigma-summation Underscript i prime Overscript n Endscripts beta Subscript i prime Superscript j Baseline k prime left-parenthesis upper P Subscript k Baseline phi left-parenthesis x right-parenthesis comma upper P Subscript k Baseline phi left-parenthesis x Subscript i prime Baseline right-parenthesis right-parenthesis, n is the training data set size, and k prime is a new kernel function different from k. Unlike the iterative pre-image method, the mapping method has no nonconvergence issues because it does not involve iteration. The mapping pre-image method is also faster than the iterative method, because once the mapping function is learned, you can score a batch of data all at the same time, instead of one observation at a time as in the iterative pre-image method.

Last updated: September 10, 2021