An Evolutionary Algorithm with Crossover and Mutation for Model-Based Clustering
An evolutionary algorithm (EA) is developed as an alternative to the EM algorithm for parameter estimation in model-based clustering. This EA facilitates a different search of the fitness landscape, i.e., the likelihood surface, utilizing both crossover and mutation. Furthermore, this EA represents an efficient approach to "hard" model-based clustering and so it can be viewed as a sort of generalization of the k-means algorithm, which is itself equivalent to a restricted Gaussian mixture model. The EA is illustrated on several datasets, and its performance is compared to other hard clustering approaches and model-based clustering via the EM algorithm.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringGeneral Classificationparameter estimationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms
We re-investigate a fundamental question: how effective is crossover in Genetic Algorithms in combining building blocks of good solutions? Although this has been discussed controversially for decades, we are still lackin…
Evolutionary AlgorithmsA Survey and Analysis of Evolutionary Operators for Permutations
There are many combinatorial optimization problems whose solutions are best represented by permutations. The classic traveling salesperson seeks an optimal ordering over a set of cities. Scheduling problems often seek op…
Combinatorial OptimizationEvolutionary AlgorithmsSchedulingSurveyShortest Edit Path Crossover: A Theory-driven Solution to the Permutation Problem in Evolutionary Neural Architecture Search
Population-based search has recently emerged as a possible alternative to Reinforcement Learning (RL) for black-box neural architecture search (NAS). It performs well in practice even though it is not theoretically well …
Evolutionary AlgorithmsNeural Architecture SearchReinforcement Learning (RL)Standard Steady State Genetic Algorithms Can Hillclimb Faster than Mutation-only Evolutionary Algorithms
Explaining to what extent the real power of genetic algorithms lies in the ability of crossover to recombine individuals into higher quality solutions is an important problem in evolutionary computation. In this paper we…
Evolutionary AlgorithmsCrossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation
Evolutionary algorithms are popular algorithms for multiobjective optimisation (also called Pareto optimisation) as they use a population to store trade-offs between different objectives. Despite their popularity, the th…
Evolutionary Algorithms