{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81637"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81637","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Extending the Scalability of Linkage Learning Genetic Algorithms: Theory and Practice","abstract":"The study finds that using promoters on the chromosome can improve nucleation potential and promote correct building-block formation. It also observes that the linkage learning genetic algorithm has a consistent, sequential behavior instead of different behaviors on different problems as was previously believed. Moreover, the competition among building blocks of equal salience is the main cause of the exponential growth of convergence time. Finally, adopting subchromosome representations can reduce the competition among building blocks, and therefore, scalable genetic linkage learning for a unimetric approach is possible.","abstract_html":"The study finds that using promoters on the chromosome can improve nucleation potential and promote correct building-block formation. It also observes that the linkage learning genetic algorithm has a consistent, sequential behavior instead of different behaviors on different problems as was previously believed. Moreover, the competition among building blocks of equal salience is the main cause of the exponential growth of convergence time. Finally, adopting subchromosome representations can reduce the competition among building blocks, and therefore, scalable genetic linkage learning for a unimetric approach is possible.","abstract_has_math":false,"creators":["Chen, Ying-Ping"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Goldberg, David E."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:19:38Z","date_published":"2015-09-25T20:19:38Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3130894"],"render_values":[{"text":"(MiAaPQ)AAI3130894","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81637","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Goldberg, David E."]},{"key":"dc:creator","label":"Author","values":["Chen, Ying-Ping"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:19:38Z","10000-01-01","2004"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81637","(MiAaPQ)AAI3130894"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The study finds that using promoters on the chromosome can improve nucleation potential and promote correct building-block formation. It also observes that the linkage learning genetic algorithm has a consistent, sequential behavior instead of different behaviors on different problems as was previously believed. Moreover, the competition among building blocks of equal salience is the main cause of the exponential growth of convergence time. Finally, adopting subchromosome representations can reduce the competition among building blocks, and therefore, scalable genetic linkage learning for a unimetric approach is possible.","Made available in DSpace on 2015-09-25T20:19:38Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3130894.pdf: 4387284 bytes, checksum: 189d037ff2facfdb442381af36fc54e4 (MD5) Previous issue date: 2004","Embargo set by: Seth Robbins for item 82918 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","147 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004."]},{"key":"dc:title","label":"Title","values":["Extending the Scalability of Linkage Learning Genetic Algorithms: Theory and Practice"]}]}],"canonical_facts":{"dc:contributor":["Goldberg, David E."],"dc:creator":["Chen, Ying-Ping"],"dc:date":["2015-09-25T20:19:38Z","10000-01-01","2004"],"dc:description":["The study finds that using promoters on the chromosome can improve nucleation potential and promote correct building-block formation. It also observes that the linkage learning genetic algorithm has a consistent, sequential behavior instead of different behaviors on different problems as was previously believed. Moreover, the competition among building blocks of equal salience is the main cause of the exponential growth of convergence time. Finally, adopting subchromosome representations can reduce the competition among building blocks, and therefore, scalable genetic linkage learning for a unimetric approach is possible.","Made available in DSpace on 2015-09-25T20:19:38Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3130894.pdf: 4387284 bytes, checksum: 189d037ff2facfdb442381af36fc54e4 (MD5) Previous issue date: 2004","Embargo set by: Seth Robbins for item 82918 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","147 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004."],"dc:identifier":["http://hdl.handle.net/2142/81637","(MiAaPQ)AAI3130894"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Extending the Scalability of Linkage Learning Genetic Algorithms: Theory and Practice"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:16Z"}