Diversifying exploration of features spaces in evolutionary searches
conference contribution
posted on 2024-07-13, 07:00 authored by Tim HendtlassTim Hendtlass, Howard CoplandEvolutionary algorithms require excellent search capabilities in order to find global minima, particularly in complex feature spaces. A means of enhancing search capabilities based upon a distributed genetic-style encoding of solution has been shown to be advantageous. Such a representation requires the use of varying gene lengths. The effects of variable gene lengths are explored in detail.
History
Available versions
PDF (Published version)Publisher DOI
ISBN
9780780358713Journal title
6th International Conference on Neural Information Processing (ICONIP 99), Perth, Australia, 16-20 November 1999Conference name
6th International Conference on Neural Information Processing ICONIP 99, Perth, Australia, 16-20 November 1999Volume
2Pagination
5 ppPublisher
IEEECopyright statement
Copyright © 1999 IEEE. The published version is reproduced in accordance with the copyright policy of the publisher. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.Language
engUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC