A maximum entropy approach to sampling in EDA - The single connected case

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2905, Issue , 2003, Pages 683-690

  Ochoa, Alberto ^a,b   Höns, Robin ^a   Soto, Marta ^b   Mühlenbein, Heinz ^a  

^a FRAUNHOFER IAIS   (Germany)

^b INSTITUTO DE CIBERNÉTICA   (Cuba)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ENTROPY; EVOLUTIONARY ALGORITHMS; ITERATIVE METHODS; MESSAGE PASSING; POPULATION STATISTICS;

FACTORIZED DISTRIBUTION ALGORITHM; ITERATIVE PROPORTIONAL FITTING; JOINT DISTRIBUTIONS; JUNCTION TREES; MARGINALS; MAXIMUM ENTROPY DISTRIBUTION; MAXIMUM-ENTROPY APPROACHES; POPULATION SIZES;

PATTERN RECOGNITION;

EID: 34548098018     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24586-5_84     Document Type: Article

References (17)

1. C. K. Chow and C. N. Liu. Approximating discrete probability distributions with dependence trees. IEEE Trans. on Information Theory, IT14(3):462-467, 1968.
2. Th. M. Cover and J.A. Thomas. Elements of Information Theory. Wiley, New York, 1989.
3. I. Csiszár. I-divergence geometry of probability distributions and minimization problems. Annals of Probability, 3:146-158, 1975.
4. D. E. Goldberg. Genetic Algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MA, USA, 1989.
5. P. Grünwald. The Minimum Description Length Principle and Reasoning under Uncertainty. PhD thesis, University of Amsterdam, 1998.
6. M. Henrion. Propagating uncertainty in Bayesian networks by probabilistic logic sampling. Uncertainty in Artificial Intelligence, 2:317-324, 1988.
7. E. T. Jaynes. Information theory and statistical mechanics. Phys. Rev, 6:620-643, 1957.
8. E. T. Jaynes. Where do we stand on maximum entropy? In R. D. Levine and M. Tribus, editors, The Maximum Entropy Formalism. MIT Press, Camb., 1978.
9. F. V. Jensen and F. Jensen. Optimal junction trees. In Proc. of the 10th Conference on Uncertainty in Artificial Intelligence, pages 360-366, Seattle, Wash., 1994.
10. R. Jiroušek and St. Přeučil. On the effective implementation of the iterative proportional fitting procedure. Comput. Statistics & Data Analysis, 19:177-189, 1995.
11. S. L. Lauritzen. Graphical Models. Oxford:Clarendon Press, 1996.
12. C.-H. Meyer. Korrektes Schließen bei unvollständiger Information. PhD thesis, Fernuniversität Hagen, 1998.
13. H. Mühlenbein, Th. Mahnig, and A. Ochoa. Schemata, distributions and graphical models in evolutionary optimization. Journal of Heuristics, 5(2):213-247, 1999.
14. H. Mühlenbein and G. Paaß. From recombination of genes to the estimation of distributions i. binary parameters. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Lecture Notes in Computer Science 1141: Parallel Problem Solving from Nature - PPSN IV, pages 178-187, Berlin, 1996. Springer-Verlag.
15. J. Pearl. Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann, San Mateo, California, 1988.
16. M. Soto. A Singled Connected Factorized Distribution Algorithm and its cost of evaluation. PhD thesis, University of Havana, Havana, Cuba, July 2003. (In Spanish, adviser A. Ochoa).
17. M. Soto and A. Ochoa. A Factorized Distribution Algorithm based on polytrees. In Proceedings of the 2000 Congress on Evolutionary Computation CEC00, pages 232-237, La Jolla, California, 6-9 July 2000. IEEE Press.