Communications of the ACM
Genetic algorithms with sharing for multimodal function optimization
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
The Strength of Weak Learnability
Machine Learning
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Improving Regressors using Boosting Techniques
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Applying Boosting Techniques to Genetic Programming
Selected Papers from the 5th European Conference on Artificial Evolution
Density estimation with genetic programming for inverse problem solving
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
Hi-index | 0.00 |
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.