Genetic Programming with Boosting for Ambiguities in Regression Problems

Facing ambiguities in regression problems is a challenge. There exists many powerful evolutionary schemes to deal with regression, however, these techniques do not usually take into account ambiguities (i.e. the existence of 2 or more solutions for some or all points in the domain). Nonetheless ambiguities are present in some real world inverse problems, and it is interesting in such cases to provide the user with a choice of possible solutions. We propose in this article an approach based on boosted genetic programming in order to propose several solutions when ambiguities are detected.

[1]  L. Breiman Arcing classifier (with discussion and a rejoinder by the author) , 1998 .

[2]  Cyril Fonlupt,et al.  Applying Boosting Techniques to Genetic Programming , 2001, Artificial Evolution.

[3]  R. Schapire The Strength of Weak Learnability , 1990, Machine Learning.

[4]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[5]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[6]  R. Doerffer,et al.  Neural network for retrieval of concentrations of water constituents with the possibility of detecting exceptional out of scope spectra , 2000, IGARSS 2000. IEEE 2000 International Geoscience and Remote Sensing Symposium. Taking the Pulse of the Planet: The Role of Remote Sensing in Managing the Environment. Proceedings (Cat. No.00CH37120).

[7]  Samir W. Mahfoud Crossover interactions among niches , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[8]  Michael J. Shaw,et al.  Genetic algorithms with dynamic niche sharing for multimodal function optimization , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[9]  John R. Koza,et al.  Genetic programming 2 - automatic discovery of reusable programs , 1994, Complex Adaptive Systems.

[10]  Harris Drucker,et al.  Improving Regressors using Boosting Techniques , 1997, ICML.

[11]  A. E. Eiben,et al.  Self-adaptivity for constraint satisfaction: learning penalty functions , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[12]  Yoav Freund,et al.  Experiments with a New Boosting Algorithm , 1996, ICML.

[13]  H. Iba Bagging, Boosting, and bloating in Genetic Programming , 1999 .

[14]  Yoav Freund,et al.  A Short Introduction to Boosting , 1999 .