Evolving Gaussian Mixture Models with Splitting and Merging Mutation Operators.

Abstract excerpt

This paper describes the evolutionary split and merge for expectation maximization (ESM-EM) algorithm and eight of its variants, which are based on the use of split and merge operations to evolve Gaussian mixture models. Asymptotic time complexity analysis shows that the proposed algorithms are competitive with the state-of-the-art genetic-based expectation maximization (GA-EM) algorithm. Experiments performed in...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Models, Theoretical
• Share to Mutation