Genetic Programming Model Regularization

被引:1
|
作者
Alonso, Cesar L. [1 ]
Luis Montana, Jose [2 ]
Enrique Borges, Cruz [3 ]
机构
[1] Univ Oviedo, Ctr Inteligencia Artificial, Campus Gijon, Gijon 33271, Spain
[2] Univ Cantabria, Dept Matemat Estadist & Comput, E-39005 Santander, Spain
[3] Univ Deusto, DeustoTech Energy Unit, Bilbao 48007, Spain
来源
关键词
Genetic Programming; Straight Line Program; Pfaffian Operator; Symbolic Regression; INDUCTIVE INFERENCE;
D O I
10.1007/978-3-319-23392-5_6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose a tool for controlling the complexity of Genetic Programming models. The tool is supported by the theory of Vapnik-Chervonekis dimension (VCD) and is combined with a novel representation of models named straight line program. Experimental results, implemented on conventional algebraic structures (such as polynomials), show that the empirical risk, penalized by suitable upper bounds for the Vapnik-Chervonenkis dimension, gives a generalization error smaller than the use of statistical conventional techniques such as Bayesian or Akaike information criteria.
引用
收藏
页码:105 / 120
页数:16
相关论文
共 50 条
  • [1] Regularization approach to inductive genetic programming
    Nikolaev, NY
    Iba, H
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2001, 5 (04) : 359 - 375
  • [2] Model-driven regularization approach to straight line program genetic programming
    Montana, Jose L.
    Alonso, Cesar L.
    Borges, Cruz E.
    Tirnauca, Cristina
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2016, 57 : 76 - 90
  • [3] Genetic programming based on an adaptive regularization method
    Wu, Yanling
    Lu, Jiangang
    Sun, Youxian
    [J]. 2006 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PTS 1 AND 2, PROCEEDINGS, 2006, : 324 - 327
  • [4] Tikhonov Regularization as a Complexity Measure in Multiobjective Genetic Programming
    Ni, Ji
    Rockett, Peter
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (02) : 157 - 166
  • [5] GENETIC PROGRAMMING OF DEVELOPMENT - A MODEL
    BAILEY, DW
    [J]. DIFFERENTIATION, 1986, 33 (02) : 89 - 100
  • [6] Regularization by dynamic programming
    Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenbergerstrasse 69, A-4040 Linz, Austria
    不详
    [J]. J Inverse Ill Posed Probl, 2007, 3 (295-310): : 295 - 310
  • [7] Soft target and functional complexity reduction: A hybrid regularization method for genetic programming
    Vanneschi, Leonardo
    Castelli, Mauro
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2021, 177
  • [8] Soft target and functional complexity reduction: A hybrid regularization method for genetic programming
    Vanneschi, Leonardo
    Castelli, Mauro
    [J]. Expert Systems with Applications, 2021, 177
  • [9] Smooth fitting with a method for determining the regularization parameter under the genetic programming algorithm
    Yeun, YS
    Lee, KH
    Han, SM
    Yang, YS
    [J]. INFORMATION SCIENCES, 2001, 133 (3-4) : 175 - 194
  • [10] Smooth fitting with a method for determining the regularization parameter under the genetic programming algorithm
    Lee, KH
    Yeun, YS
    Yang, YS
    [J]. PROCEEDINGS OF THE FIFTH JOINT CONFERENCE ON INFORMATION SCIENCES, VOLS 1 AND 2, 2000, : 1056 - 1061