Genetic Programming using Chebishev Polynomials

Created by W.Langdon from gp-bibliography.bib Revision:1.4221

  title =        "Genetic Programming using Chebishev Polynomials",
  author =       "Nikolay Nikolaev and Hitoshi Iba",
  pages =        "89--96",
  year =         "2001",
  publisher =    "Morgan Kaufmann",
  booktitle =    "Proceedings of the Genetic and Evolutionary
                 Computation Conference (GECCO-2001)",
  editor =       "Lee Spector and Erik D. Goodman and Annie Wu and 
                 W. B. Langdon and Hans-Michael Voigt and Mitsuo Gen and 
                 Sandip Sen and Marco Dorigo and Shahram Pezeshk and 
                 Max H. Garzon and Edmund Burke",
  address =      "San Francisco, California, USA",
  publisher_address = "San Francisco, CA 94104, USA",
  month =        "7-11 " # jul,
  keywords =     "genetic algorithms, genetic programming,
                 regularization, time series prediction, STROGANOFF,
                 PCA, GMDH network",
  ISBN =         "1-55860-774-9",
  URL =          "",
  notes =        "GECCO-2001 A joint meeting of the tenth International
                 Conference on Genetic Algorithms (ICGA-2001) and the
                 sixth Annual Genetic Programming Conference (GP-2001)
                 Part of \cite{spector:2001:GECCO}

                 overfitting avoidance. polynomial harmonic GP. Tested
                 on Mackey-Glass, Sunspots, Yen-Dollar exchange rate
                 prediction, time lags Complexity penalty, Akaike, H.
                 (1970). Statistical Predictor Identification. Annals of
                 the Institute of 25 Statistical Mathematics 22, 203 -
                 217. fitness multipled by (N+M)/(N-M)


Genetic Programming entries for Nikolay Nikolaev Hitoshi Iba