|
Abstract
|
|
|---|---|
| One of the uses of the probabilistic models learned by estimation of distribution algorithms is to reveal previous unknown information about the problem structure. In this paper we investigate the mapping between the problem structure and the dependencies captured in the probabilistic models learned by EDAs for a set of multi-objective satisfiability problems. We present and discuss the application of different data mining and visualization techniques for processing and visualizing relevant information from the structure of the learned probabilistic models. We show that also in the case of multi-objective optimization problems, some features of the original problem structure can be translated to the probabilistic models and unveiled by using algorithms that mine the model structures. | |
|
International
|
Si |
|
Congress
|
11th Anual Genetic and Evolutionary Computation Conference (GECCO-2009) Associaton for Computing Machinery (ACM) |
|
|
960 |
|
Place
|
Montreal (Canadá) |
|
Reviewers
|
Si |
|
ISBN/ISSN
|
978-1-60558-325-9 |
|
|
|
|
Start Date
|
08/07/2009 |
|
End Date
|
12/07/2009 |
|
From page
|
445 |
|
To page
|
452 |
|
|
Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO-2009), ACM |