Symbolic regression using tabu search in a neighborhood of semantically similar solutions

Research output: Chapter in Book/Report/Conference proceedingsConference contributionpeer-review

1 Citation (Scopus)

Abstract

In this paper we describe for the first time a tabu search algorithm for symbolic regression. The novel contribution presented in this work is the idea to use a metric for semantic similarity to generate moves in such a way that branches are only replaced with semantically similar branches. In symbolic regression separate parts of the solution are linked strongly; often a small random change of one part might disrupt a link and thus, can completely change the semantics of the solution. We hypothesize that by introducing the semantic similarity constraint, the fitness landscape for tabu search becomes smoother as each move can only change the fitness of the solution slightly. However, empirical evaluation on a set of simple benchmark instances shows that the approach described in this paper does not perform as well as genetic programming with offspring selection and there is no big difference between random and semantic move generation.

Original languageEnglish
Title of host publication24th European Modeling and Simulation Symposium, EMSS 2012
Pages379-384
Number of pages6
Publication statusPublished - 2012
Event24th European Modeling and Simulation Symposium, EMSS 2012 - Vienna, Austria
Duration: 19 Sep 201221 Sep 2012

Publication series

Name24th European Modeling and Simulation Symposium, EMSS 2012

Conference

Conference24th European Modeling and Simulation Symposium, EMSS 2012
CountryAustria
CityVienna
Period19.09.201221.09.2012

Keywords

  • Genetic programming
  • Semantic similarity
  • Symbolic regression
  • Tabu search

Fingerprint Dive into the research topics of 'Symbolic regression using tabu search in a neighborhood of semantically similar solutions'. Together they form a unique fingerprint.

Cite this