Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Rosipal, R.
Right arrow Articles by Girolami, M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Rosipal, R.
Right arrow Articles by Girolami, M.
(Neural Computation. 2001;13:505-510.)
© 2001 The MIT Press


Note

An Expectation-Maximization Approach to Nonlinear Component Analysis

Roman Rosipal

Computational Intelligence Research Unit, Department of Computing and Information Systems, University of Paisley, Paisley, PA1 2BE, Scotland, U.K.

Mark Girolami

Computational Intelligence Research Unit, Department of Computing and Information Systems, University of Paisley, Paisley, PA1 2BE, Scotland, U.K.

The proposal of considering nonlinear principal component analysis as a kernel eigenvalue problem has provided an extremely powerful method of extracting nonlinear features for a number of classification and regression applications. Whereas the utilization of Mercer kernels makes the problem of computing principal components in, possibly, infinite-dimensional feature spaces tractable, there are still the attendant numerical problems of diagonalizing large matrices. In this contribution, we propose an expectation-maximization approach for performing kernel principal component analysis and show this to be a computationally efficient method, especially when the number of data points is large.




This article has been cited by other articles:


Home page
Neural Comput.Home page
G. Gins, I. Y. Smets, and J. F. Van Impe
Efficient Tracking of the Dominant Eigenspace of a Normalized Kernel Matrix
Neural Comput., February 1, 2008; 20(2): 523 - 554.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
J.-H. Ahn and J.-H. Oh
A Constrained EM Algorithm for Principal Component Analysis
Neural Comput., January 1, 2003; 15(1): 57 - 65.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
T. Van Gestel, J. A. K. Suykens, G. Lanckriet, A. Lambrechts, B. De Moor, and J. Vandewalle
Bayesian Framework for Least-Squares Support Vector Machine Classifiers, Gaussian Processes, and Kernel Fisher Discriminant Analysis
Neural Comput., May 1, 2002; 14(5): 1115 - 1147.
[Abstract] [Full Text]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2001 by The MIT Press.