A Maximum Entropy Approach to Sampling in EDA ? The Single Connected Case

The success of evolutionary algorithms, in particular Factorized Distribution Algorithms (FDA), for many pattern recognition tasks heavily depends on our ability to reduce the number of function evaluations.

[1]  E. Jaynes.  Information Theory and Statistical Mechanics , 1957 .

[2]  R. Jirousek,et al.  On the effective implementation of the iterative proportional fitting procedure , 1995 .

[3]  E. T. Jaynes,et al.  Where do we Stand on Maximum Entropy , 1979 .

[4]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6]  I. Good,et al.  The Maximum Entropy Formalism. , 1979 .

[7]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[8]  Frank Jensen,et al.  Optimal junction Trees , 1994, UAI.

[9]  A. Ochoa,et al.  A factorized distribution algorithm based on polytrees , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[10]  Max Henrion,et al.  Propagating uncertainty in bayesian networks by probabilistic logic sampling , 1986, UAI.

[11]  P. Grünwald.  The Minimum Description Length Principle and Reasoning under Uncertainty , 1998 .

[12]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[13]  C. N. Liu,et al.  Approximating discrete probability distributions with dependence trees , 1968, IEEE Trans. Inf. Theory.

[14]  Heinz Mühlenbein,et al.  Schemata, Distributions and Graphical Models in Evolutionary Optimization , 1999, J. Heuristics.

[15]  I. Csiszár.  $I$-Divergence Geometry of Probability Distributions and Minimization Problems , 1975 .

[16]  Hans-Paul Schwefel,et al.  Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.