Nonlinear component analysis as a kernel eigenvalue problem
Neural computation, 1998•ieeexplore.ieee.org
A new method for performing a nonlinear form of principal component analysis is proposed.
By the use of integral operator kernel functions, one can efficiently compute principal
components in high-dimensional feature spaces, related to input space by some nonlinear
map—for instance, the space of all possible five-pixel products in 16× 16 images. We give
the derivation of the method and present experimental results on polynomial feature
extraction for pattern recognition.
By the use of integral operator kernel functions, one can efficiently compute principal
components in high-dimensional feature spaces, related to input space by some nonlinear
map—for instance, the space of all possible five-pixel products in 16× 16 images. We give
the derivation of the method and present experimental results on polynomial feature
extraction for pattern recognition.
A new method for performing a nonlinear form of principal component analysis is proposed. By the use of integral operator kernel functions, one can efficiently compute principal components in high-dimensional feature spaces, related to input space by some nonlinear map—for instance, the space of all possible five-pixel products in 16 × 16 images. We give the derivation of the method and present experimental results on polynomial feature extraction for pattern recognition.
ieeexplore.ieee.org