Exploring overfitting in genetic programming grégory Paris

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2936, Issue , 2004, Pages 267-277

  Robilliard, Denis ^a   Fonlupt, Cyril ^a  

^a UNIVERSITÉ DU LITTORAL CÔTE D OPALE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; GENETIC ALGORITHMS; LEARNING SYSTEMS; SUPERVISED LEARNING;

GENETIC PROGRAMMING ALGORITHMS; OVERFITTING; SUPERVISED MACHINE LEARNING; SYMBOLIC REGRESSION;

GENETIC PROGRAMMING;

EID: 35048873768     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (17)

1. Koza, J.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. The MIT Press (1992).
2. Langdon, W.B.: Size fair and homologous tree crossover for tree genetic programming. In: Genetic Programing and Evolvable Machines. Volume 1., Boston, Kluwer Academic Publishers (2000) 95-119.
3. Mitchell, T.M.: Machine Learning. Me Graw-Hill (1997)
4. Ng, A.Y.: Preventing overfitting of cross-validation data. In: Proc. 14th International Conference on Machine Learning, Morgan Kaufmann (1997) 245-253
5. Cavaretta, M.J., Chellapilla, K.: Data mining using genetic programming: The implications of parsimony on generalization error. In Angeline, P.J., Michalewicz, Z., Schoenauer, M., Yao, X., Zalzala, A., eds.: Proceedings of the Congress of Evolutionary Computation. Volume 2., Mayflower Hotel, Washington D.C., USA, IEEE Press (1999) 1330-1337.
6. Paris, G., Robilliard, D., Fonlupt, C.: Applying boosting techniques to genetic programming. In: [14] (2001) 267-278.
7. Paris, G., Robilliard, D., Fonlupt, C.: Genetic programming with boosting for ambiguities in regression problems. In: [15] (2003) 183-193.
8. Iba, H.: Bagging, boosting, and bloating in genetic programming. In: [?] (1999) 1053-1060.
9. Langdon, W.B.: Combining decision trees and neural networks for drug discovery. In: [17] (2002) 60-70.
10. Y. Freund, R.S.: A short introduction to boosting. Journal of Japanese Society for Artificial Intelligence (1999) 771-780.
11. Y. Freund, Y.M., Schapire, R.: Why averaging classifiers can protect against overfitting. In: Proceeding of the Eighth international Workshop on Artificial Intelligence and Statistics (2001).
12. Luke, S.: When short runs beat long runs. In: Proceedings of GECCO-2001, Morgan Kaufmann (2001) 74-80.
13. Domingos, P.: The role of Occam's razor in knowledge discovery. Data Mining and Knowledge Discovery 3 (1999) 409-425.
14. Collet, P., Fonlupt, C., Hao, J.-K., Lutton, E. and SChoenauer, M., editors. Artificial Evolution, 5th International Conference, Evolution Artificielle, EA 2001, Le Creusot, France, 2001, LNCS 2310, Springer.
15. Ryan, G., Soule, T., Keijzer, M., Tsang, E., Poli, R. and Costa, E., editors. 6th European Conference, EuroGP 2001, LNCS 2610, Springer.
16. Banzhaf, W., Daida, J., Eiben, A., Garzon, M., Honavar, V., Jakiela, M. and Smith, R., editors. Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida, USA, July 1999, Morgan-Kaufmann.
17. Foster, J., Lutton, E., Miller, J., Ryan, C. and Tettamanzi,A., editors. 5th European Conference, EuroGP 2001, LNCS 2278, Springer.