|
|
||||||||
Note |
jonghun{at}postech.ac.kr, Department of Physics, Pohang University of Science and Technology, Pohang, Ky
ngbuk, Korea
jhoh{at}postech.ac.kr, Department of Physics, Pohang University of Science and Technology, Pohang, Ky
ngbuk, Korea
We propose a constrained EM algorithm for principal component analysis (PCA) using a coupled probability model derived from single-standard factor analysis models with isotropic noise structure. The single probabilistic PCA, especially for the case where there is no noise, can find only a vector set that is a linear superposition of principal components and requires postprocessing, such as diagonalization of symmetric matrices. By contrast, the proposed algorithm finds the actual principal components, which are sorted in descending order of eigenvalue size and require no additional calculation or postprocessing. The method is easily applied to kernel PCA. It is also shown that the new EM algorithm is derived from a generalized least-squares formulation.
This article has been cited by other articles:
![]() |
H. Xiong and Y. Choe Structural systems identification of genetic regulatory networks Bioinformatics, February 15, 2008; 24(4): 553 - 560. [Abstract] [Full Text] [PDF] |
||||
![]() |
Y. Xia and G. Feng On Convergence Conditions of an Extended Projection Neural Network Neural Comput., March 1, 2005; 17(3): 515 - 525. [Abstract] [Full Text] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
| J COGNITIVE NEUROSCIENCE | NEURAL COMPUTATION | MIT PRESS JOURNALS |