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 Chan, K.
Right arrow Articles by Sejnowski, T. J.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Chan, K.
Right arrow Articles by Sejnowski, T. J.
(Neural Computation. 2003;15:1991-2011.)
© 2003 The MIT Press


Letter

Variational Bayesian Learning of ICA with Missing Data

Kwokleung Chan

kwchan{at}salk.edu, Computational Neurobiology Laboratory, Salk Institute, La Jolla, CA 92037, U.S.A.

Te-Won Lee

tewon{at}salk.edu, Institute for Neural Computation, University of California at San Diego, La Jolla, CA 92093, U.S.A.

Terrence J. Sejnowski

terry{at}salk.edu, Computational Neurobiology Laboratory, Salk Institute, La Jolla, CA 92037, U.S.A., and Department of Biology, University of California at San Diego, La Jolla, CA 92093, U.S.A.

Missing data are common in real-world data sets and are a problem for many estimation techniques. We have developed a variational Bayesian method to perform independent component analysis (ICA) on highdimensional data containing missing entries. Missing data are handled naturally in the Bayesian framework by integrating the generative density model. Modeling the distributions of the independent sources with mixture of gaussians allows sources to be estimated with different kurtosis and skewness. Unlike the maximum likelihood approach, the variational Bayesian method automatically determines the dimensionality of the data and yields an accurate density model for the observed data without overfitting problems. The technique is also extended to the clusters of ICA and supervised classification framework.




This article has been cited by other articles:


Home page
Neural Comput.Home page
S. Haykin and Z. Chen
The Cocktail Party Problem
Neural Comput., September 1, 2005; 17(9): 1875 - 1902.
[Abstract] [Full Text] [PDF]




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