遗传算法的分类工具

2008 International Multiconference on Computer Science and Information Technology Pub Date : 2008-10-01 DOI:10.1109/IMCSIT.2008.4747234

S. Kotowski, W. Kosinski, Z. Michalewicz, P. Synak, Lukasz Brocki

{"title":"遗传算法的分类工具","authors":"S. Kotowski, W. Kosinski, Z. Michalewicz, P. Synak, Lukasz Brocki","doi":"10.1109/IMCSIT.2008.4747234","DOIUrl":null,"url":null,"abstract":"Some tools to measure convergence properties of genetic algorithms are introduced. A classification procedure is proposed for genetic algorithms based on a conjecture: the entropy and the fractal dimension of trajectories produced by them are quantities that characterize the classes of the algorithms. The role of these quantities as invariants of the algorithm classes is discussed together with the compression ratio of points of the genetic algorithm.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"339 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On classification tools for genetic algorithms\",\"authors\":\"S. Kotowski, W. Kosinski, Z. Michalewicz, P. Synak, Lukasz Brocki\",\"doi\":\"10.1109/IMCSIT.2008.4747234\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Some tools to measure convergence properties of genetic algorithms are introduced. A classification procedure is proposed for genetic algorithms based on a conjecture: the entropy and the fractal dimension of trajectories produced by them are quantities that characterize the classes of the algorithms. The role of these quantities as invariants of the algorithm classes is discussed together with the compression ratio of points of the genetic algorithm.\",\"PeriodicalId\":267715,\"journal\":{\"name\":\"2008 International Multiconference on Computer Science and Information Technology\",\"volume\":\"339 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Multiconference on Computer Science and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMCSIT.2008.4747234\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Multiconference on Computer Science and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMCSIT.2008.4747234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

介绍了一些测量遗传算法收敛性的工具。基于一个猜想，提出了一种遗传算法的分类方法:由遗传算法产生的轨迹的熵和分形维数是表征算法类别的量。讨论了这些量作为算法类不变量的作用，并讨论了遗传算法的点压缩比。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On classification tools for genetic algorithms

Some tools to measure convergence properties of genetic algorithms are introduced. A classification procedure is proposed for genetic algorithms based on a conjecture: the entropy and the fractal dimension of trajectories produced by them are quantities that characterize the classes of the algorithms. The role of these quantities as invariants of the algorithm classes is discussed together with the compression ratio of points of the genetic algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 International Multiconference on Computer Science and Information Technology

自引率

0.00%

发文量