Principal Component Analysis (PCA) is a very well known statistical tool. KERNEL PCA is a nonlinear extension to PCA based on the kernel paradigm. In this paper we characterize the projections found by KERNEL PCA from a information theoretic perspective. We prove that KERNEL PCA provides optimum entropy projections in the input space when the Gaussian kernel is used for the mapping and a sample estimate of Renyi's entropy based on the Parzen window method is employed. The information theoretic interpretation motivates the choice and specifices the kernel used for the transformation to feature space. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Paiva, A. R. C., Xu, J. W., & Príncipe, J. C. (2006). Kernel principal components are maximum entropy projections. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3889 LNCS, pp. 846–853). https://doi.org/10.1007/11679363_105
Mendeley helps you to discover research relevant for your work.