Created by W.Langdon from gp-bibliography.bib Revision:1.7970
Model complexity based on second order partial derivaties (not tree size). Form n by n Hessian matrix, where n is number of inputs (terminal set size). Each element is 2nd order partial dertivative of GP tree with respect to input i and input j. Hessian is symetric matrix. Matrix C is Hessian with all constant terms set to zero.
Complexity = determinant of C divided by the determinant of H. (calculated with python package SymPy). Division replaced by analytic quotiant \cite{Ni:2012:ieeeTEC}.
Data missing at random.
Five OpenML benchmarks. Compare python DEAP with Linear Regression, PMM, KNN (R package Simpulation).
http://www.evostar.org/2020/cfp_eurogp.php Part of \cite{Hu:2020:GP} EuroGP'2020 held in conjunction with EvoCOP2020, EvoMusArt2020 and EvoApplications2020",
Genetic Programming entries for Baligh Al-Helali Qi Chen Bing Xue Mengjie Zhang