Neural Comp. Sign up for ETOCS
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 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 Google Scholar
Google Scholar
Right arrow Articles by Mollah, Md. N. H.
Right arrow Articles by Eguchi, S.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Mollah, Md. N. H.
Right arrow Articles by Eguchi, S.
(Neural Computation. 2005;18:166-190.)
© 2005 The MIT Press


Letter

Exploring Latent Structure of Mixture ICA Models by the Minimum ß-Divergence Method

Md. Nurul Haque Mollah

nhmollah{at}ism.ac.jp, Department of Statistical Science, Graduate University for Advanced Studies, Minato-ku, Tokyo 106-8569, Japan

Mihoko Minami

mminami{at}ism.ac.jp, Institute of Statistical Mathematics and the Graduate University for Advanced Studies, Minato-ku, Tokyo 106-8569, Japan

Shinto Eguchi

eguchi{at}ism.ac.jp, Institute of Statistical Mathematics and the Graduate University for Advanced Studies, Minato-ku, Tokyo 106-8569, Japan

Independent component analysis (ICA) attempts to extract original independent signals (source components) that are linearly mixed in a basic framework. This letter discusses a learning algorithm for the separation of different source classes in which the observed data follow a mixture of several ICA models, where each model is described by a linear combination of independent and nongaussian sources. The proposed method is based on a sequential application of the minimum ß-divergence method to separate all source classes sequentially. The proposed method searches the recovering matrix of each class on the basis of a rule of sequential change of the shifting parameter. If the initial choice of the shifting parameter vector is close to the mean of a data class, then all of the hidden sources belonging to that class are recovered properly with independent and nongaussian structure considering the data in other classes as outliers. The value of the tuning parameter ß is a key in the performance of the proposed method. A cross-validation technique is proposed as an adaptive selection procedure for the tuning parameter ß for this algorithm, together with applications for both real and synthetic data analysis.







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