2010
DOI: 10.1162/evco_a_00010
|View full text |Cite
|
Sign up to set email alerts
|

Sensibility of Linkage Information and Effectiveness of Estimated Distributions

Abstract: The probabilistic model building performed by estimation of distribution algorithms (EDAs) enables these methods to use advanced techniques of statistics and machine learning for automatic discovery of problem structures. However, in some situations, it may not be possible to completely and accurately identify the whole problem structure by probabilistic modeling due to certain inherent properties of the given problem. In this work, we illustrate one possible cause of such situations with problems consisting o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…To demonstrate this composition, consider our first test problem, F1, which is formed by concatenating ten 4-bit trap or inverse trap functions and one switch variable, s41, 1000 to 10000, and each of these experiments was repeated for 50 times. Tournament selection is adopted as selection method, and we set the tournament size to 16 (which has been reported suitable for ECGA to handle the range of 40-to 80-bit concatenated trap problems [4].) In these experiments, the stopping criterion is set such that a run is terminated when all solutions in the population converge to the same fitness value.…”
Section: Experiments and Resultsmentioning
confidence: 99%
“…To demonstrate this composition, consider our first test problem, F1, which is formed by concatenating ten 4-bit trap or inverse trap functions and one switch variable, s41, 1000 to 10000, and each of these experiments was repeated for 50 times. Tournament selection is adopted as selection method, and we set the tournament size to 16 (which has been reported suitable for ECGA to handle the range of 40-to 80-bit concatenated trap problems [4].) In these experiments, the stopping criterion is set such that a run is terminated when all solutions in the population converge to the same fitness value.…”
Section: Experiments and Resultsmentioning
confidence: 99%
“…This characteristic, which is often called the imbalance problem, can have a detrimental effect on the optimization performance if not handled properly. For example, Chuang and Chen [139] showed that the model building process of EDAs is affected by the imbalance problem. They reported that the selected individuals based on which the probabilistic model of EDAs is updated lacks the necessary information about the linkage structure of some parts of the problem.…”
Section: B Resource Allocation and The Imbalance Problemmentioning
confidence: 99%
“…Sadowski et al [36] faced similar difficulties when applying the LTGA to the MAX-SAT. According to the literature, such bad results could be caused by a high degree of interactions [30] or the non-uniformity of fitness contributions associated with subsets of variables [37]. However, few studies have followed in such a direction [38,39].…”
Section: Introductionmentioning
confidence: 99%