# The Factorized Distribution Algorithm and the Junction Tree: A Learning Perspective

**Download:**
PDF.

“The Factorized Distribution Algorithm and the Junction Tree: A
Learning Perspective”
by
A. Ochoa,
M. R. Soto,
R. Santana,
J. Madera, and N. Jorge.
In *Proceedings of the Second Symposium on Artificial Intelligence
(CIMAF-99)*, (A.
Ochoa, M.
R. Soto, and R.
Santana, eds.), (Havana, Cuba), Mar. 1999, pp. 368-377.

## Abstract

This paper extends the FDA - the Factorized Distribution Algorithm - with
a structural learning component. The FDA has been extensively investigated
for the optimization of additively decomposed discrete functions (ADFs).
Now, we are able to deal with more general problems, which are solved by
FDA in a blackbox optimization scenario. The key point is the construction
of the Junction Tree, which is placed at the centre of the algorithm.
Learning the Junction Tree directly from the data is a process that is
accomplished by making independency tests of as lower as possible order.
The proposed algorithm belongs to the class of Estimation Distribution
Algorithms and represents an interesting alternative to approach the
Linkage Problem in Genetic Algorithms.

**Download:**
PDF.

**BibTeX entry:**

@inproceedings{Ochoa_et_al:1999,
author = {A. Ochoa and M. R. Soto and R. Santana and J. Madera and N.
Jorge},
editor = {A. Ochoa and M. R. Soto and R. Santana},
title = {The Factorized Distribution Algorithm and the Junction Tree: A
Learning Perspective},
booktitle = {Proceedings of the Second Symposium on Artificial
Intelligence (CIMAF-99)},
pages = {368--377},
publisher = {Editorial Academia. Havana, Cuba},
address = {Havana, Cuba},
month = mar,
year = {1999},
isbn = {959-02-024101}
}

(This webpage was created with
bibtex2web.)

Back to Roberto Santana publications.