论文信息 - Genetic algorithm with the dynamic probability of mutation in the classification problem

Genetic algorithm with the dynamic probability of mutation in the classification problem

A method of dynamic establishment of mutation probability in the genetic algorithm generation has been proposed in this paper. Results obtained by means of the genetic algorithm with constant and variable mutation probability respectively, have been compared. These methods have been tested on biomedical data.

Joanna Lis | J. Lis

[1] J. David Schaffer,et al. An Adaptive Crossover Distribution Mechanism for Genetic Algorithms , 1987, ICGA.

[2] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[3] Lawrence Davis,et al. Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[4] R. Fisher. THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS , 1936 .

[5] Rajarshi Das,et al. A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization , 1989, ICGA.

[6] Terence C. Fogarty,et al. Varying the Probability of Mutation in the Genetic Algorithm , 1989, ICGA.

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

[8] Lawrence Davis,et al. Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.

[9] Reiko Tanese,et al. Distributed Genetic Algorithms , 1989, ICGA.

[10] Kenneth Alan De Jong,et al. An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

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

[12] James E. Baker,et al. Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.