Searching for Novel Regression Functions

Conferences Papers
  1. Yuliana Mart\'ınez, Enrique Naredo, Leonardo Trujillo and Edgar Galván López. Searching for novel regression functions. In IEEE Congress on Evolutionary Computation. 2013, 16-23. BibTeX

    @inproceedings{DBLP:conf/cec/MartinezNTL13,
    	author = "Yuliana Mart\'{\i}nez and Enrique Naredo and Leonardo Trujillo and Edgar Galv{\'a}n L{\'o}pez",
    	title = "Searching for novel regression functions",
    	booktitle = "IEEE Congress on Evolutionary Computation",
    	year = 2013,
    	pages = "16-23",
    	ee = "http://dx.doi.org/10.1109/CEC.2013.6557548",
    	crossref = "DBLP:conf/cec/2013",
    	bibsource = "DBLP, http://dblp.uni-trier.de"
    }
    
  2. Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2013, Cancun, Mexico, June 20-23, 2013. IEEE, 2013. BibTeX

    @proceedings{DBLP:conf/cec/2013,
    	title = "Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2013, Cancun, Mexico, June 20-23, 2013",
    	booktitle = "IEEE Congress on Evolutionary Computation",
    	publisher = "IEEE",
    	year = 2013,
    	isbn = "978-1-4799-0452-5, 978-1-4799-0453-2",
    	ee = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6552460",
    	bibsource = "DBLP, http://dblp.uni-trier.de"
    }
    
Abstract

The objective function is the core element in most search algorithms that are used to solve engineering and scientific problems, referred to as the fitness function in evolutionary computation. Some researchers have attempted to bridge this difference by reducing the need for an explicit fitness function. A noteworthy example is the novelty  search  (NS)  algorithm, that substitutes fitness with a measure of uniqueness, or novelty, that each individual introduces into the search. NS employs the concept of behavioral space, where each individual is described by a domain-specific descriptor that captures the main features of an individual’s performance. However, defining a behavioral descriptor is not trivial, and most works with NS have focused on robotics. This paper  is an extension  of recent attempts to expand the application domain of NS. In particular, it represents the first attempt to apply NS on symbolic regression with genetic programming (GP). The relationship between the proposed NS algorithm and recent semantics-based GP algorithms is explored. Results are encouraging and consistent with recent findings, where NS achieves below average performance on easy problems, and achieves very good performance on hard problems. In summary, this paper presents the first attempt to apply NS on symbolic regression, a continuation of recent research devoted at extending the domain of competence for behavior-based search

Published in
IEEE Congress on Evolutionary Computation (CEC)
Pages 16 - 23
http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6557709&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6557709
Date of conference
20-23 June 2013
E-ISBN
978-1-4799-0452-5
ISBN
978-1-4799-0453-2

 

Last modified onTuesday, 08 October 2013 04:37
(0 votes)
Read 3237 times