ACM Home Page
Please provide us with feedback. Feedback
Mining probabilistic models learned by EDAs in the optimization of multi-objective problems
Full text PdfPdf (544 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
SESSION: Track 5: estimation of distribution algorithms table of contents
Pages 445-452  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Roberto Santana  Universidad Politécnica de Madrid, Madrid, Spain
Concha Bielza  Universidad Politécnica de Madrid, Madrid, Spain
Jose A. Lozano  University of the Basque Country, San Sebastian, Spain
Pedro Larrañaga  Universidad Politécnica de Madrid, Madrid, Spain
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 35,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1569963
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
L. A. N. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley. Classes of small-world networks. Proceedings of the National Academy of Sciences (PNAS), 97(21):11149--11152, 2000.
 
2
E. Bengoetxea. Inexact Graph Matching Using Estimation of Distribution Algorithms. PhD thesis, Ecole Nationale Supérieure des Télécommunications, 2003.
 
3
P. A. Bosman. Design and Application of Iterated Density-Estimation Evolutionary Algorithms. PhD thesis, Universiteit Utrecht, Utrecht, The Netherlands, 2003.
 
4
C. Echegoyen, R. Santana, J. A. Lozano, and P. Larrañaga. The impact of probabilistic learning algorithms in EDAs based on Bayesian networks. In Linkage in Evolutionary Computation, Studies in Computational Intelligence, pages 109--139. Springer, 2008.
 
5
R. Etxeberria and P. Larrañaga. Global optimization using Bayesian networks. In A. Ochoa, M. R. Soto, and R. Santana, editors, Proceedings of the Second Symposium on Artificial Intelligence (CIMAF-99), pages 151--173, Havana, Cuba, 1999.
 
6
B. J. Frey and D. Dueck. Clustering by passing messages between data points. Science, 315:972--976, 2007.
 
7
8
 
9
M. Hauschild, M. Pelikan, K. Sastry, and D. E. Goldberg. Using previous models to bias structural learning in the hierarchical BOA. MEDAL Report No. 2008003, Missouri Estimation of Distribution Algorithms Laboratory (MEDAL), 2008.
 
10
 
11
 
12
S. C. Johnson. Hierarchical clustering schemes. Psychometrika, 2:241--254, 1967.
 
13
N. Khan, D. E. Goldberg, and M. Pelikan. Multi-objective Bayesian optimization algorithm. IlliGAL Report No. 2002009, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 2002.
 
14
P. Larrañaga and J. A. Lozano, editors. Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Boston/Dordrecht/London, 2002.
 
15
16
 
17
C. F. Lima, M. Pelikan, D. E. Goldberg, F. G. Lobo, K. Sastry, and M. Hauschild. Influence of selection and replacement strategies on linkage learning in BOA. In Proceedings of the 2007 Congress on Evolutionary Computation CEC-2007, pages 1083--1090. IEEE Press, 2007.
 
18
 
19
 
20
K. Murphy. The BayesNet toolbox for Matlab. Computer science and Statistics: Proceedings of Interface, 33, 2001.
 
21
 
22
M. Pelikan, K. Sastry, and D. E. Goldberg. Multiobjective hBOA, clustering and scalability. IlliGAL Report No. 2005005, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, February 2005.
 
23
R. Santana, C. Echegoyen, A. Mendiburu, C. Bielza, J. A. Lozano, P. Larrañaga, R. Armañanzas, and S. Shakya. MATEDA: A suite of EDA programs in Matlab. Technical Report EHU-KZAA-I2/09, Department of Computer Science and Artificial Intelligence, University of the Basque Country, February 2009.
 
24
R. Santana, P. Larrañaga, and J. A. Lozano. The role of a priori information in the minimization of contact potentials by means of estimation of distribution algorithms. In Proceedings of the Fifth European Conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics, volume 4447 of Lecture Notes in Computer Science, pages 247--257. Springer Verlag, 2007.
 
25
26

Collaborative Colleagues:
Roberto Santana: colleagues
Concha Bielza: colleagues
Jose A. Lozano: colleagues
Pedro Larrañaga: colleagues