Detail publikace

The Parallel Bayesian Optimization Algorithm

OČENÁŠEK, J. SCHWARZ, J.

Originální název

The Parallel Bayesian Optimization Algorithm

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

In the last few years there has been a growing interest in the field of Estimation of Distribution Algorithms (EDAs), where crossover and mutation genetic operators are replaced by probability estimation and sampling techniques. The Bayesian Optimization Algorithm incorporates methods for learning Bayesian networks and uses these to model the promising solutions and generate new ones. The aim of this paper is to propose the parallel version of this algorithm, where the optimization time decreases linearly with the number of processors. During the parallel construction of network, the explicit topological ordering of variables is used to keep the model acyclic. The performance of the optimization process seems to be not affected by this constraint and our version of algorithm was successfully tested for the discrete combinatorial problem represented by graph partitioning as well as for deceptive functions.

Klíčová slova

EDA, BOA, Bayesian network, probabilistic model, fine-grained parallelism, parallel computing

Autoři

OČENÁŠEK, J.; SCHWARZ, J.

Vydáno

1. 1. 2000

Nakladatel

Springer Verlag

Místo

Košice

ISBN

3-7908-1322-2

Kniha

Proceedings of the European Symposium on Computational Inteligence

ISSN

1615-3871

Periodikum

Advances in Soft Computing

Stát

neuvedeno

Strany od

61

Strany do

67

Strany počet

7

URL

BibTex

@inproceedings{BUT191579,
  author="Jiří {Očenášek} and Josef {Schwarz}",
  title="The Parallel Bayesian Optimization Algorithm",
  booktitle="Proceedings of the European Symposium on Computational Inteligence",
  year="2000",
  journal="Advances in Soft Computing",
  pages="61--67",
  publisher="Springer Verlag",
  address="Košice",
  isbn="3-7908-1322-2",
  issn="1615-3871",
  url="http://www.fit.vutbr.cz/~schwarz/PDFCLANKY/ISCI00.pdf"
}