Extending the Scalability of Linkage Learning Genetic Algorithms : Theory & Practice
Genetic algorithms (GAs) are powerful search techniques based on principles of evolution and widely applied to solve problems in many disciplines. However, unable to learn linkage among genes, most GAs employed in practice nowadays suffer from the linkage problem, which refers to the need of appropr...
Đã lưu trong:
| Tác giả chính: | |
|---|---|
| Định dạng: | Livre numérique |
| Ngôn ngữ: | Anglais |
| Được phát hành: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Phiên bản: | 1st ed. 2006. |
| Loạt: | Studies in Fuzziness and Soft Computing
190 |
| Truy cập trực tuyến: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Chú thích: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Extending the Scalability of Linkage Learning Genetic Algorithms, Texte imprimé, 9783540284598 • Extending the Scalability of Linkage Learning Genetic Algorithms, Texte imprimé, 9783642066719 • Extending the Scalability of Linkage Learning Genetic Algorithms, Texte imprimé, 9783540814726 • Extending the Scalability of Linkage Learning Genetic Algorithms, Texte imprimé, 9783540284598 |
| LEADER | 04360nam a22003617a 4500 | ||
|---|---|---|---|
| 001 | 937728 | ||
| 008 | 080409q2000 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN123096936 | ||
| 020 | |a 9783540324133 | ||
| 041 | 0 | |a eng | |
| 082 | |a 519 | ||
| 100 | 1 | |a Chen, Ying-ping, |d 19..- | |
| 245 | 1 | 0 | |a Extending the Scalability of Linkage Learning Genetic Algorithms : |b Theory & Practice |c edited by Ying-ping Chen. |
| 250 | |a 1st ed. 2006. | ||
| 260 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Studies in Fuzziness and Soft Computing |v 190 |x 1860-0808 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 1 | |a Introduction Genetic Algorithms and Genetic Linkage Genetic Linkage Learning Techniques Linkage Learning Genetic Algorithm Preliminaries: Assumptions and the Test Problem A First Improvement: Using Promoters Convergence Time for the Linkage Learning Genetic Algorithm.-Introducing Subchromosome Representations Conclusions | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a Genetic algorithms (GAs) are powerful search techniques based on principles of evolution and widely applied to solve problems in many disciplines. However, unable to learn linkage among genes, most GAs employed in practice nowadays suffer from the linkage problem, which refers to the need of appropriately arranging or adaptively ordering the genes on chromosomes during the evolutionary process. These GAs require their users to possess prior domain knowledge of the problem such that the genes on chromosomes can be correctly arranged in advance. One way to alleviate the burden of GA users is to make the algorithm capable of adapting and learning genetic linkage by itself. In order to tackle the linkage problem, the linkage learning genetic algorithm (LLGA) was proposed using a unique combination of the (gene number, allele) coding scheme and an exchange crossover to permit GAs to learn tight linkage of building blocks through a special probabilistic expression. While the LLGA performs much better on badly scaled problems than simple GAs, it does not work well on uniformly scaled problems as other competent GAs. Therefore, we need to understand why it is so and need to know how to design a better LLGA or whether there are certain limits of such a linkage learning process. This book aims to gain better understanding of the LLGA in theory and to improve the LLGA's performance in practice. It starts with a survey and classification of the existing genetic linkage learning techniques and describes the steps and approaches taken to tackle the research topics, including using promoters, developing the convergence time model, and adopting subchromosomes. It also provides the experimental results for observation of the linkage learning process as well as for verification of the theoretical models proposed in this study | ||
| 776 | 0 | |t Extending the Scalability of Linkage Learning Genetic Algorithms |b Texte imprimé |z 9783540284598 | |
| 776 | 0 | |t Extending the Scalability of Linkage Learning Genetic Algorithms |b Texte imprimé |z 9783642066719 | |
| 776 | 0 | |t Extending the Scalability of Linkage Learning Genetic Algorithms |b Texte imprimé |z 9783540814726 | |
| 776 | 0 | |t Extending the Scalability of Linkage Learning Genetic Algorithms |b Texte imprimé |z 9783540284598 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b102053 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-9V2CHZ4D-N |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:74792726X |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/b102053 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750939338 |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/b102053 |z Accès INSA CVL | |
| 997 | |0 937728 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||