In a large number of experimental problems the high dimensionality of the search space and economical constraints can severely limit the number of experiment points that can be tested. Under this constraints, optimization techniques perform poorly in particular when little a priori knowledge is available. In this work we investigate the possibility of combining approaches from advanced statistics and optimization algorithms to effectively explore a combinatorial search space sampling a limited number of experimental points. To this purpose we propose the Naïve Bayes Ant Colony Optimization (NACO) procedure. We tested its performance in a simulation study. © 2013 Springer-Verlag.
Naïve Bayes ant colony optimization for experimental design
Borrotti Matteo;Borrotti Matteo;
2013
Abstract
In a large number of experimental problems the high dimensionality of the search space and economical constraints can severely limit the number of experiment points that can be tested. Under this constraints, optimization techniques perform poorly in particular when little a priori knowledge is available. In this work we investigate the possibility of combining approaches from advanced statistics and optimization algorithms to effectively explore a combinatorial search space sampling a limited number of experimental points. To this purpose we propose the Naïve Bayes Ant Colony Optimization (NACO) procedure. We tested its performance in a simulation study. © 2013 Springer-Verlag.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
