Skip to search formSkip to main contentSkip to account menu

Probabilistic Model Building and Competent Genetic Programming

This paper describes probabilistic model building genetic programming (PM-BGP) developed based on the extended compact genetic algorithm (eCGA). Unlike traditional genetic programming, which use…
View via Publisher (opens in a new tab)

Linkage Learning via Probabilistic Modeling in the Extended Compact Genetic Algorithm (ECGA)

TLDR
This chapter reveals the existence of GA-like algorithms that are potentially orders of magnitude faster and more accurate than the simple GA, and argues that these problems are equivalent.
View via Publisher (opens in a new tab)

Dependency Structure Matrix, Genetic Algorithms, and Effective Recombination

TLDR
An automated dependency structure matrix clustering technique is developed and utilizes it to design a model-building genetic algorithm that learns and delivers the problem structure and helps researchers gain important insights through the explicitness of the procedure.
View on MIT Press (opens in a new tab)

Combating user fatigue in iGAs: partial ordering, support vector machines, and synthetic fitness

TLDR
The proposed method combines partial ordering concepts, notion of non-domination from multiobjective optimization, and support vector machines to synthesize a fitness model based on user evaluation to combat user fatigue.
View on ACM (opens in a new tab)

Multiobjective hBOA, clustering, and scalability

TLDR
The algorithm mohBOA differs from the multiobjective variants of BOA and hBOA proposed in the past by including clustering in the objective space and allocating an approximately equally sized portion of the population to each cluster.
View on ACM (opens in a new tab)

Scalability of the Bayesian optimization algorithm

View via Publisher (opens in a new tab)

Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence)

TLDR
This work discusses linkage Learning via Probabilistic Modeling in the Extended Compact Genetic Algorithm and Hierarchical Bayesian Optimization Algorithm, as well as multiobjective Estimation of Distribution Algorithms.

Evaluation-Relaxation Schemes for Genetic and Evolutionary Algorithms

TLDR
This thesis investigates fitness inheritance as an evaluation relaxation scheme, in which the fitness values of some individuals are inherited from their parents rather than through a costly evaluation function, thereby reducing the total function-evaluation cost.

Fitness Inheritance in the Bayesian Optimization Algorithm

TLDR
The results indicate that fitness inheritance is a promising concept in BOA, because population-sizing requirements for building appropriate models of promising solutions lead to good fitness estimates even if only a small proportion of candidate solutions is evaluated using the actual fitness function.
View PDF on arXiv (opens in a new tab)

Tournament Selection: Stable Fitness Pressure in XCS

TLDR
This paper identifies problem properties in which performance of proportionate selection is impaired and tournament selection is introduced which makes XCS more parameter independent, noise independent, and more efficient in exploiting fitness guidance.
View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)