Learning Mixture Models Using a Genetic Version of the EM Algorithm
In Pattern Recognition Letters 21 (2000) 759-769
Abstract:
The need to find new pattern recognition techniques that correctly classify complex structures has arisen as an important field of research. A well-known solution to this problem, which has proven to be very powerful, is the use of mixture models. Mixture models are typically fitted using the EM (Expectation-Maximization) algorithm. Unfortunately, optimal results are not always achieved because the EM algorithm, iterative in nature, is only guaranteed to produce a local maximum. In this article, a solution to this problem is proposed and tested in a complex structure where the classical EM algorithm normally fails. This we will do by means of a genetic algorithm (GA) which will allow the system to combine different solutions in a stochastic search so as to produce better results.
The reported results show the usefulness of this approach, and suggest how it can be successfully implemented. Two new algorithms are proposed. The first one is useful when {\em a priori\/} information of the observed data is not available. The second solution is useful for those cases where some knowledge of the structure of the data-set is known. This second solution has proven to converge faster than the first one, although the final results reached are very similar to each other.