IDA - Intelligent Data Analysis Research Group

BibTeX Entry

  file = {Posik2010CauchyEDAvsPOEMS.pdf},
  category = {ida-publications},
  author = {Petr Po{\v s}{\'i}k and Ji{\v r}{\'i} Kubal{\'i}k},
  title = {Comparison of Cauchy EDA and pPOEMS algorithms on the BBOB noiseless testbed},
  booktitle = {GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation},
  year = {2010},
  publisher = {ACM},
  address = {New York, NY, USA},
  pages = {1703-1710},
  url = {},
  keywords = {bbob, benchmarking, cauchy, ea, eda, poems},
  abstract = {Estimation-of-distribution algorithm using Cauchy sampling distribution is compared with the iterative prototype optimization algorithm with evolved improvement steps. While Cauchy EDA is better on unimodal functions, iterative prototype optimization is more suitable for multimodal functions. This paper compares the results for both algorithms in more detail and adds to the understanding of their key features and differences.},
  vvvs = {1},
  obory = {JC, JD},
  zamer = {VZ BIO},
  projects = {MLSC},

Creative Commons License  Content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Czech Republic License.