PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
An introduction to variable and feature selection
The Journal of Machine Learning Research
Dependency trees, permutations, and quadratic assignment problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Introduction to Machine Learning
Introduction to Machine Learning
Machine Learning: A Probabilistic Perspective
Machine Learning: A Probabilistic Perspective
| Hi-index | 0.00 |
Estimation of Distribution Algorithms (EDAs) have been successfully applied to a wide variety of problems. The algorithmic model of EDA is generic and can virtually be used with any distribution model, ranging from the mere Bernoulli distribution to the sophisticated Bayesian network. The Hidden Markov Model (HMM) is a well-known graphical model useful for modelling populations of variable-length sequences of discrete values. Surprisingly, HMMs have not yet been used as distribution estimators for an EDA, although they are a very powerful tool for estimating sequential samples. This paper thus proposes a new method, called HMM-EDA, implementing this idea, along with some preliminary experimental results.