Mason Archival Repository Service

Speeding Up Evolution through Learning: LEM

Show simple item record

dc.contributor.author Michalski, Ryszard S.
dc.contributor.author Cervone, Guido
dc.contributor.author Kaufman, Kenneth A.
dc.date.accessioned 2006-11-03T18:17:05Z
dc.date.available 2006-11-03T18:17:05Z
dc.date.issued 2000-06 en_US
dc.identifier.citation Michalski, R. S., Cervone, G. and Kaufman, K., " Speeding Up Evolution through Learning: LEM," Proceedings of the Ninth International Symposium on Intelligent Information Systems, Bystra, Poland, June 12-16 2000. en_US
dc.identifier.uri https://hdl.handle.net/1920/1466
dc.description.abstract This paper reports briefly on the development of a new approach to evolutionary computation, called the Learnable Evolution Model or LEM. In contrast to conventional Darwinian-type evolutionary algorithms that employ mutation and/or recombination, LEM employs machine learning to generate new populations. At each step of evolution, LEM determines hypotheses explaining why certain individuals in the population are superior to others in performing the designated class of tasks. These hypotheses are then instantiated to create a next generation. In the testing studies described here, we compared a program implementing LEM with selected evolutionary computation algorithms on a range optimization problems and a filter design problem. In these studies, LEM significantly outperformed the evolutionary computation algorithms, sometimes speeding up the evolution by two or more orders of magnitude in the number of evolutionary steps (births). LEM was also applied to a real-world problem of designing optimized heat exchangers. The resulting designs matched or outperformed the best human designs.
dc.format.extent 2066 bytes
dc.format.extent 151160 bytes
dc.format.mimetype text/xml
dc.format.mimetype application/pdf
dc.language.iso en_US en_US
dc.relation.ispartofseries P 00-8 en_US
dc.title Speeding Up Evolution through Learning: LEM en_US
dc.type Presentation en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search MARS


Browse

My Account

Statistics