About: Optimization via Classification     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • The vast majority of population based optimization algorithms use selection in such a way that the non selected individuals do not have any effect on the evolution at all, even though they may carry a valueable information information about the search space areas where the search should be suppressed and/or about the local shape of the search distribution. This article describes a unified way of taking advantage of the information hidden in the non selected individuals in the framework of evolutionary algorithms: first, build a classifier discriminating between selected and non selected individuals, then turn the description of selected individuals into a search distribution, and sample new offspring from it. The concept is verified by a simple real valued evolutionary algorithm which outperforms the state of the art evolutionary strategy with covariance matrix adaptation (CMA ES) on selected test functions in all tested search space dimensionalities.
  • The vast majority of population based optimization algorithms use selection in such a way that the non selected individuals do not have any effect on the evolution at all, even though they may carry a valueable information information about the search space areas where the search should be suppressed and/or about the local shape of the search distribution. This article describes a unified way of taking advantage of the information hidden in the non selected individuals in the framework of evolutionary algorithms: first, build a classifier discriminating between selected and non selected individuals, then turn the description of selected individuals into a search distribution, and sample new offspring from it. The concept is verified by a simple real valued evolutionary algorithm which outperforms the state of the art evolutionary strategy with covariance matrix adaptation (CMA ES) on selected test functions in all tested search space dimensionalities. (en)
  • Většina populačních optimalizačních algoritmů používá selekci takovým způsobem, že jedinci, kteří nejsou vybraní, nemají na další evoluci žádný vliv, ačkoli mohou nést důležitou informaci - informaci o těch oblastech prohledávaného prostoru, kde by mělo být hledání potlačeno, a/nebo o lokálním tvaru vyhledávacího rozdělení. Tento článek popisuje způsob, jak využít informaci skrytou v nevybraných jedincích v rámci evolučních algoritmů: nejprve je vytvořen klasifikátor oddělující vybrané a nevybrané jedince, popis vybraných jedinců je převeden na pravděpodobnostní model a noví jedinci jsou navzorkováni z tohoto modelu. Tento koncept je ověřen na jednoduchém evolučním algoritmu v reálné oblasti, který na zvolených testovacích funkcích překonává evoluční algoritmus s adaptací kovarianční matice. (cs)
Title
  • Optimization via Classification
  • Optimalizace použitím klasifikace (cs)
  • Optimization via Classification (en)
skos:prefLabel
  • Optimization via Classification
  • Optimalizace použitím klasifikace (cs)
  • Optimization via Classification (en)
skos:notation
  • RIV/68407700:21230/07:03131926!RIV08-MSM-21230___
http://linked.open.../vavai/riv/strany
  • 12;17
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM6840770012)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 439916
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/07:03131926
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Gauss distribution; classifier; elliptic; optimization (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [F453C4275804]
http://linked.open...v/mistoKonaniAkce
  • Praha
http://linked.open...i/riv/mistoVydani
  • Brno
http://linked.open...i/riv/nazevZdroje
  • Mendel 2007
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Pošík, Petr
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Vysoké učení technické v Brně
https://schema.org/isbn
  • 978-80-214-3473-8
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software