A BYY split-and-merge em algorithm for Gaussian mixture learning

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Gaussian mixture is a powerful statistic tool and has been widely used in the fields of information processing and data analysis. However, its model selection, i.e., the selection of number of Gaussians in the mixture, is still a difficult problem. Fortunately, the new established Bayesian Ying-Yang (BYY) harmony function becomes an efficient criterion for model selection on the Gaussian mixture modeling. In this paper, we propose a BYY split-and-merge EM algorithm for Gaussian mixture to maximize the BYY harmony function by splitting or merging the unsuited Gaussians in the estimated mixture obtained from the EM algorithm in each time dynamically. It is demonstrated well by the experiments that this BYY split-and-merge EM algorithm can make both model selection and parameter estimation efficiently for the Gaussian mixture modeling. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Li, L., & Ma, J. (2008). A BYY split-and-merge em algorithm for Gaussian mixture learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5263 LNCS, pp. 600–609). Springer Verlag. https://doi.org/10.1007/978-3-540-87732-5_67

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free