000147848 001__ 147848
000147848 005__ 20190316234743.0
000147848 020__ $$a978-1-60558-325-9
000147848 0247_ $$2doi$$a10.1145/1569901.1570036
000147848 037__ $$aCONF
000147848 245__ $$aApproximating geometric crossover in semantic space
000147848 269__ $$a2009
000147848 260__ $$bAssociation for Computing Machinery$$c2009$$aNew York, NY, USA
000147848 336__ $$aConference Papers
000147848 520__ $$aWe propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program's evaluation profile with respect to a set of fitness cases and constraining to a specific class of metric-based fitness functions, we cause the fitness landscape in the semantic space to have perfect fitness-distance correlation. The proposed approximately geometric semantic crossover exploits this property of the semantic fitness landscape by an appropriate sampling. We demonstrate also how the proposed method may be conveniently combined with hill climbing. We discuss the properties of the methods, and describe an extensive computational experiment concerning logical function synthesis and symbolic regression.
000147848 6531_ $$aGenetic Programming
000147848 6531_ $$aCrossover Operator
000147848 6531_ $$aSemantic Space
000147848 6531_ $$aEvolutionary Robotics
000147848 700__ $$aKrawiec, Krzysztof
000147848 700__ $$g191506$$aLichocki, Pawel$$0243230
000147848 7112_ $$dJuly 8-12, 2009$$cMontreal, Québec, Canada$$a11th Annual conference on Genetic and evolutionary computation (GECCO-2009)
000147848 773__ $$tProceedings of the 11th Annual conference on Genetic and evolutionary computation$$q987-994
000147848 8564_ $$uhttp://portal.acm.org/citation.cfm?id=1569901.1570036$$zURL
000147848 8564_ $$uhttps://infoscience.epfl.ch/record/147848/files/krawiec2009approximating.pdf$$zPublisher's version$$s626480$$yPublisher's version
000147848 909C0 $$xU10370$$0252161$$pLIS
000147848 909CO $$ooai:infoscience.tind.io:147848$$qGLOBAL_SET$$pconf$$pSTI
000147848 917Z8 $$x255330
000147848 937__ $$aEPFL-CONF-147848
000147848 973__ $$rREVIEWED$$sPUBLISHED$$aOTHER
000147848 980__ $$aCONF