Introduction to statistical pattern recognition (2nd ed.)
Introduction to statistical pattern recognition (2nd ed.)
Generalization of the EM algorithm for mixture density estimation
Pattern Recognition Letters
Split and Merge EM Algorithm for Improving Gaussian Mixture Density Estimates
Journal of VLSI Signal Processing Systems
Pattern Recognition Letters
A fully Bayesian model based on reversible jump MCMC and finite Beta mixtures for clustering
Expert Systems with Applications: An International Journal
Hi-index | 0.10 |
The mixture density model has been extensively studied in the field of statistical pattern recognition. And the EM algorithm has been well known as a convenient and efficient tool to iteratively compute the maximum likelihood estimates of mixture model parameters (except the number of components in mixture). However, it is a difficult problem to estimate the number of components in mixture. In order to solve this problem, we present a new mixture density model based on the concept of group, which is defined as a pair of different components. With the new mixture density model, it is possible for two components to have the same component parameters, so the accurate estimation of the number of components is no longer needed. Based on the new mixture density model, the mixture density estimation method with group membership functions is derived, and it is demonstrated to be an efficient method in the experiments of normal mixture density estimations.