A stepwise evolutionary approach to machine learning

The biological concepts of stepwise evolution and cumulative selection are used to develop programs for a digital computer. The initial goal of these programs is to separate small, two-dimensional arrays of binary valued patterns into two classes. Learning is accomplished by the automatic evaluation...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Hintz, K.J.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 563
container_issue
container_start_page 559
container_title
container_volume
creator Hintz, K.J.
description The biological concepts of stepwise evolution and cumulative selection are used to develop programs for a digital computer. The initial goal of these programs is to separate small, two-dimensional arrays of binary valued patterns into two classes. Learning is accomplished by the automatic evaluation of a criterion of separability of the two classes for each of the possible single-step mutations of the initial classification program. The mutant program which performs best is then selected automatically by the environment program and used as the new classification program. Only four operations are initially available, but as each classification program is mutated and cumulatively selected based on its performance, a new classification program is developed for implementing this particular classification. Each resulting program is then assigned a next sequential number, stored in mass storage, and made available for use as a single program step by subsequent programs. As the development program is run, it not only learns how to dichotomize more patterns but also has available to it the results of previous evolutionary learning experiences.< >
doi_str_mv 10.1109/ISIC.1988.65491
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_65491</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>65491</ieee_id><sourcerecordid>65491</sourcerecordid><originalsourceid>FETCH-LOGICAL-i86t-ad613a075a2ee07919f6636066d1ce7c7da73ce0e6dd32a0a86575dee93e93ea3</originalsourceid><addsrcrecordid>eNo9j0tLxDAUhYMPcBi7Fnf5A603TXOTLIfiozDgwtkPl-aORjptaariv7c-8HDgWxw4nCPElYJCKfA3zVNTF8o7V6CpvDoRq1IZl3tn_anIvHXglMMSVIln_xnChchSeoVFxriq8itRbWSaefyIiSW_D93bHIeepk9J4zgN1L7IeZDHhbFn2TFNfeyfL8X5gbrE2R_XYnd3u6sf8u3jfVNvtnl0OOcUUGkCa6hkBuuVPyBqBMSgWratDWR1y8AYgi4JyKGxJjB7_W3Sa3H9WxuZeT9O8bgM2_8c1l-r60dp</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A stepwise evolutionary approach to machine learning</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Hintz, K.J.</creator><creatorcontrib>Hintz, K.J.</creatorcontrib><description>The biological concepts of stepwise evolution and cumulative selection are used to develop programs for a digital computer. The initial goal of these programs is to separate small, two-dimensional arrays of binary valued patterns into two classes. Learning is accomplished by the automatic evaluation of a criterion of separability of the two classes for each of the possible single-step mutations of the initial classification program. The mutant program which performs best is then selected automatically by the environment program and used as the new classification program. Only four operations are initially available, but as each classification program is mutated and cumulatively selected based on its performance, a new classification program is developed for implementing this particular classification. Each resulting program is then assigned a next sequential number, stored in mass storage, and made available for use as a single program step by subsequent programs. As the development program is run, it not only learns how to dichotomize more patterns but also has available to it the results of previous evolutionary learning experiences.&lt; &gt;</description><identifier>ISSN: 2158-9860</identifier><identifier>ISBN: 9780818620126</identifier><identifier>ISBN: 0818620129</identifier><identifier>EISSN: 2158-9879</identifier><identifier>DOI: 10.1109/ISIC.1988.65491</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Application software ; Biological information theory ; Biology computing ; Data mining ; Evolution (biology) ; Genetic mutations ; Machine learning ; Organisms ; Polynomials ; Stochastic processes</subject><ispartof>Proceedings IEEE International Symposium on Intelligent Control 1988, 1988, p.559-563</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/65491$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4048,4049,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/65491$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hintz, K.J.</creatorcontrib><title>A stepwise evolutionary approach to machine learning</title><title>Proceedings IEEE International Symposium on Intelligent Control 1988</title><addtitle>ISIC</addtitle><description>The biological concepts of stepwise evolution and cumulative selection are used to develop programs for a digital computer. The initial goal of these programs is to separate small, two-dimensional arrays of binary valued patterns into two classes. Learning is accomplished by the automatic evaluation of a criterion of separability of the two classes for each of the possible single-step mutations of the initial classification program. The mutant program which performs best is then selected automatically by the environment program and used as the new classification program. Only four operations are initially available, but as each classification program is mutated and cumulatively selected based on its performance, a new classification program is developed for implementing this particular classification. Each resulting program is then assigned a next sequential number, stored in mass storage, and made available for use as a single program step by subsequent programs. As the development program is run, it not only learns how to dichotomize more patterns but also has available to it the results of previous evolutionary learning experiences.&lt; &gt;</description><subject>Application software</subject><subject>Biological information theory</subject><subject>Biology computing</subject><subject>Data mining</subject><subject>Evolution (biology)</subject><subject>Genetic mutations</subject><subject>Machine learning</subject><subject>Organisms</subject><subject>Polynomials</subject><subject>Stochastic processes</subject><issn>2158-9860</issn><issn>2158-9879</issn><isbn>9780818620126</isbn><isbn>0818620129</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1988</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9j0tLxDAUhYMPcBi7Fnf5A603TXOTLIfiozDgwtkPl-aORjptaariv7c-8HDgWxw4nCPElYJCKfA3zVNTF8o7V6CpvDoRq1IZl3tn_anIvHXglMMSVIln_xnChchSeoVFxriq8itRbWSaefyIiSW_D93bHIeepk9J4zgN1L7IeZDHhbFn2TFNfeyfL8X5gbrE2R_XYnd3u6sf8u3jfVNvtnl0OOcUUGkCa6hkBuuVPyBqBMSgWratDWR1y8AYgi4JyKGxJjB7_W3Sa3H9WxuZeT9O8bgM2_8c1l-r60dp</recordid><startdate>1988</startdate><enddate>1988</enddate><creator>Hintz, K.J.</creator><general>IEEE Comput. Soc. Press</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1988</creationdate><title>A stepwise evolutionary approach to machine learning</title><author>Hintz, K.J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i86t-ad613a075a2ee07919f6636066d1ce7c7da73ce0e6dd32a0a86575dee93e93ea3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1988</creationdate><topic>Application software</topic><topic>Biological information theory</topic><topic>Biology computing</topic><topic>Data mining</topic><topic>Evolution (biology)</topic><topic>Genetic mutations</topic><topic>Machine learning</topic><topic>Organisms</topic><topic>Polynomials</topic><topic>Stochastic processes</topic><toplevel>online_resources</toplevel><creatorcontrib>Hintz, K.J.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hintz, K.J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A stepwise evolutionary approach to machine learning</atitle><btitle>Proceedings IEEE International Symposium on Intelligent Control 1988</btitle><stitle>ISIC</stitle><date>1988</date><risdate>1988</risdate><spage>559</spage><epage>563</epage><pages>559-563</pages><issn>2158-9860</issn><eissn>2158-9879</eissn><isbn>9780818620126</isbn><isbn>0818620129</isbn><abstract>The biological concepts of stepwise evolution and cumulative selection are used to develop programs for a digital computer. The initial goal of these programs is to separate small, two-dimensional arrays of binary valued patterns into two classes. Learning is accomplished by the automatic evaluation of a criterion of separability of the two classes for each of the possible single-step mutations of the initial classification program. The mutant program which performs best is then selected automatically by the environment program and used as the new classification program. Only four operations are initially available, but as each classification program is mutated and cumulatively selected based on its performance, a new classification program is developed for implementing this particular classification. Each resulting program is then assigned a next sequential number, stored in mass storage, and made available for use as a single program step by subsequent programs. As the development program is run, it not only learns how to dichotomize more patterns but also has available to it the results of previous evolutionary learning experiences.&lt; &gt;</abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/ISIC.1988.65491</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2158-9860
ispartof Proceedings IEEE International Symposium on Intelligent Control 1988, 1988, p.559-563
issn 2158-9860
2158-9879
language eng
recordid cdi_ieee_primary_65491
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Application software
Biological information theory
Biology computing
Data mining
Evolution (biology)
Genetic mutations
Machine learning
Organisms
Polynomials
Stochastic processes
title A stepwise evolutionary approach to machine learning
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T00%3A04%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20stepwise%20evolutionary%20approach%20to%20machine%20learning&rft.btitle=Proceedings%20IEEE%20International%20Symposium%20on%20Intelligent%20Control%201988&rft.au=Hintz,%20K.J.&rft.date=1988&rft.spage=559&rft.epage=563&rft.pages=559-563&rft.issn=2158-9860&rft.eissn=2158-9879&rft.isbn=9780818620126&rft.isbn_list=0818620129&rft_id=info:doi/10.1109/ISIC.1988.65491&rft_dat=%3Cieee_6IE%3E65491%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=65491&rfr_iscdi=true