论文信息 - Wavelet packets and genetic algorithms

Wavelet packets and genetic algorithms

This paper is devoted to the theoretical analysis of the fitness function in genetic algorithms using wavelet packet (WP) transforms. More specifically, WP transforms are used to calculate the average fitness value of a schema. Based on this one can decide whether a certain function is easy or hard for a genetic algorithm. The result is an extension of Bethke's (1980) work who discovered an efficient method for calculating schema average fitness values using the Walsh transform.

[1] Albert Donally Bethke,et al. Genetic Algorithms as Function Optimizers , 1980 .

[2] D. E. Goldberg,et al. Genetic Algorithms in Search , 1989 .

[3] David E. Goldberg,et al. Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction , 1989, Complex Syst..

[4] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6] Akram Aldroubi. Oblique multiwavelet bases: examples , 1996, Optics & Photonics.

[7] J. Astola,et al. Binary polynomial transforms and nonlinear digital filters , 1995 .

[8] Sami Khuri,et al. Walsh and Haar functions in genetic algorithms , 1994, SAC '94.

[9] Michael T. Orchard,et al. Wavelet packets-based image coding using joint space-frequency quantization , 1994, Proceedings of 1st International Conference on Image Processing.

[10] Jelena Kovacevic,et al. Wavelets and Subband Coding , 2013, Prentice Hall Signal Processing Series.