ParadisEO: a framework for parallel and distributed biologically inspired heuristics

In this paper we present ParadisEO, an open source framework for flexible parallel and distributed design of hybrid metaheuristics. Flexibility means that the parameters such as data representation and variation operators can be evolved. It is inherited from the EO object-oriented library for evolutionary computation. ParadisEO provides different parallel and/or distributed models and allows a transparent multi-threaded implementation. Moreover, it supplies different natural hybridization mechanisms mainly for metaheuristics including evolutionary algorithms and local search methods. The framework is experimented here in the spectroscopic data mining field. The flexibility property allowed an easy and straightforward development of a geneticalgorithm-based attribute selection for models discovery in NIR spectroscopic data. Experiments on a cluster of SMPs (IBM SP3) show that a good speed-up is achieved by using the provided parallel distributed models and multi-threading. Furthermore, the hybridization of the GA with the efficient PLS method allows to discover high-quality models. Indeed, their accuracy and understandability are improved respectively by 37% and 88%.

[1]  Hervé Meunier,et al.  Algorithmes évolutionnaires parallèles pour l'optimisation multi-objectif de réseaux de télécommunications mobiles , 2002 .

[2]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[3]  S. Wold,et al.  The multivariate calibration problem in chemistry solved by the PLS method , 1983 .

[4]  G. P. McKeown,et al.  Optimization Software Class Libraries , 2002, Operations Research/Computer Science Interfaces Series.

[5]  Keinosuke Fukunaga,et al.  A Branch and Bound Algorithm for Feature Subset Selection , 1977, IEEE Transactions on Computers.

[6]  P. Langley Selection of Relevant Features in Machine Learning , 1994 .

[7]  Hiroshi Motoda,et al.  Feature Extraction, Construction and Selection: A Data Mining Perspective , 1998 .

[8]  Ludovic Duponchel,et al.  Sucrose Content Determination of Sugar Beets by near Infrared Reflectance Spectroscopy. Comparison of Calibration Methods and Calibration Transfer , 2002 .

[9]  Maarten Keijzer,et al.  Evolving Objects: A General Purpose Evolutionary Computation Library , 2001, Artificial Evolution.

[10]  Kenneth A. De Jong,et al.  Genetic algorithms as a tool for feature selection in machine learning , 1992, Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92.

[11]  Huan Liu,et al.  Towards an evolutionary algorithm: a comparison of two feature selection algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[12]  Diego H. Milone,et al.  Evolutionary algorithm for speech segmentation , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[13]  David L. Woodruff,et al.  Optimization software class libraries , 2002 .

[14]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[15]  Juan Julián Merelo Guervós,et al.  Evolving Multilayer Perceptrons , 2000, Neural Processing Letters.

[16]  Hiroshi Motoda,et al.  Feature Extraction, Construction and Selection , 1998 .

[17]  Huan Liu,et al.  Feature Selection for Classification , 1997, Intell. Data Anal..