Dybowski, R.; Collins, T. D. and Weller, P. R.
(1996).
|
Due to copyright restrictions, this file is not available for public download |
| URL: | http://mitpress.mit.edu/catalog/item/default.asp?t... |
|---|---|
| Google Scholar: | Look up in Google Scholar |
Abstract
Understanding the evolution of a complex genetic algorithm is a non-trivial problem, however, genetic-algorithm visualization is in its infancy. This paper reviews some of the current approaches and presents a new visualization approach based on Sammon mapping. Sammon mapping is a nonlinear mapping of a set of vectors in p-dimensional space to a set in r-dimensional space, where r < p. The mapping attempts to preserve in r-space the Euclidean inter-vector distances present in p-space. We demonstrate that a Sammon mapping to 2-space of binary chromosomes present in a higher-dimensional allele space during the execution of a genetic algorithm can indicate the presence of multiple solutions. Shortfalls of this approach are discussed along with possible solutions.
| Item Type: | Conference Item |
|---|---|
| Copyright Holders: | 1996 MIT Press |
| Funders: | Special Trustees for St Thomas' Hospital (London), Engineering and Physical Sciences Research Council |
| Extra Information: | Workshop Proceedings ISBN: 9781874152040
Conference Proceedings ISBN: 978-0-262-06190-2 The Proceedings of the Fifth Annual Conference on Evolutionary Programming (EP96), MIT Press. San Diego, CA. Edited by L.J. Fogel, P.J. Angeline, and T. Baeck. pages 377 - 38 |
| Academic Unit/Department: | Knowledge Media Institute |
| Interdisciplinary Research Centre: | Centre for Research in Computing (CRC) |
| Related URLs: | |
| Item ID: | 28582 |
| Depositing User: | Kay Dave |
| Date Deposited: | 17 May 2011 12:52 |
| Last Modified: | 26 Oct 2012 04:47 |
| URI: | http://oro.open.ac.uk/id/eprint/28582 |
Actions (login may be required)
| View Item | |
| Public: Report issue / request change |