The Crossover Closure and Partial Match Detection
The crossover closure generation rule characterizes the generalization achieved by artificial immune systems using partial match detection. The paper reviews earlier results and extends the previously introduced notion of crossover closure to encompass additional match rules. For concreteness, the d...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 260 |
|---|---|
| container_issue | |
| container_start_page | 249 |
| container_title | |
| container_volume | 2787 |
| creator | Esponda, Fernando Forrest, Stephanie Helman, Paul |
| description | The crossover closure generation rule characterizes the generalization achieved by artificial immune systems using partial match detection. The paper reviews earlier results and extends the previously introduced notion of crossover closure to encompass additional match rules. For concreteness, the discussion focuses on r-chunks matching, giving alternative ways that detectors can be used to implement the crossover closure. |
| doi_str_mv | 10.1007/978-3-540-45192-1_24 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_15691643</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3088179_29_260</sourcerecordid><originalsourceid>FETCH-LOGICAL-p318t-8c334ecff0e8a5aba4b06b08998e9bbc444565097b9c360edea04bed5733d84a3</originalsourceid><addsrcrecordid>eNotkMtOwzAQRc1TlNI_YJENS8M44zj2EpWnVASLsrYcZ0oDISl2isTf4z5GI410753R6DB2KeBaAJQ3ptQceSGBy0KYnAubywM2STImcauJQzYSSgiOKM0RO98aUCpljtkIEHJuSomnbGSSr0GW6oxNYvyEVJiLFB0xMV9SNg19jP0vhWza9nEdKHNdnb25MDSuzV7c4JfZHQ3kh6bvLtjJwrWRJvs5Zu8P9_PpE5-9Pj5Pb2d8hUIPXPv0FfnFAki7wlVOVqAq0MZoMlXlpZSFKsCUlfGogGpyICuqixKx1tLhmF3t7q5c9K5dBNf5JtpVaL5d-LOiUEYoiSmX73IxWd0HBVv1_Ve0AuwGpE3ELNqExm6h2Q3ItIT746H_WVMcLG22PHVDcK1futVAIVoErUVpbJ5aAf4DKq9vzA</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3088179_29_260</pqid></control><display><type>book_chapter</type><title>The Crossover Closure and Partial Match Detection</title><source>Springer Books</source><creator>Esponda, Fernando ; Forrest, Stephanie ; Helman, Paul</creator><contributor>Hart, Emma ; Bentley, Peter ; Timmis, Jon</contributor><creatorcontrib>Esponda, Fernando ; Forrest, Stephanie ; Helman, Paul ; Hart, Emma ; Bentley, Peter ; Timmis, Jon</creatorcontrib><description>The crossover closure generation rule characterizes the generalization achieved by artificial immune systems using partial match detection. The paper reviews earlier results and extends the previously introduced notion of crossover closure to encompass additional match rules. For concreteness, the discussion focuses on r-chunks matching, giving alternative ways that detectors can be used to implement the crossover closure.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540407669</identifier><identifier>ISBN: 9783540407669</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540451921</identifier><identifier>EISBN: 3540451927</identifier><identifier>DOI: 10.1007/978-3-540-45192-1_24</identifier><identifier>OCLC: 934980476</identifier><identifier>LCCallNum: QA75.5-76.95</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; Computer science; control theory; systems ; Concept Drift ; Crossover Operator ; Detection Scheme ; Directed Acyclic Graph ; Exact sciences and technology ; Match Rule ; Pattern recognition. Digital image processing. Computational geometry ; Software ; Speech and sound recognition and synthesis. Linguistics</subject><ispartof>Artificial Immune Systems, 2003, Vol.2787, p.249-260</ispartof><rights>Springer-Verlag Berlin Heidelberg 2003</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3088179-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-45192-1_24$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-45192-1_24$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15691643$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Hart, Emma</contributor><contributor>Bentley, Peter</contributor><contributor>Timmis, Jon</contributor><creatorcontrib>Esponda, Fernando</creatorcontrib><creatorcontrib>Forrest, Stephanie</creatorcontrib><creatorcontrib>Helman, Paul</creatorcontrib><title>The Crossover Closure and Partial Match Detection</title><title>Artificial Immune Systems</title><description>The crossover closure generation rule characterizes the generalization achieved by artificial immune systems using partial match detection. The paper reviews earlier results and extends the previously introduced notion of crossover closure to encompass additional match rules. For concreteness, the discussion focuses on r-chunks matching, giving alternative ways that detectors can be used to implement the crossover closure.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer science; control theory; systems</subject><subject>Concept Drift</subject><subject>Crossover Operator</subject><subject>Detection Scheme</subject><subject>Directed Acyclic Graph</subject><subject>Exact sciences and technology</subject><subject>Match Rule</subject><subject>Pattern recognition. Digital image processing. Computational geometry</subject><subject>Software</subject><subject>Speech and sound recognition and synthesis. Linguistics</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540407669</isbn><isbn>9783540407669</isbn><isbn>9783540451921</isbn><isbn>3540451927</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2003</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkMtOwzAQRc1TlNI_YJENS8M44zj2EpWnVASLsrYcZ0oDISl2isTf4z5GI410753R6DB2KeBaAJQ3ptQceSGBy0KYnAubywM2STImcauJQzYSSgiOKM0RO98aUCpljtkIEHJuSomnbGSSr0GW6oxNYvyEVJiLFB0xMV9SNg19jP0vhWza9nEdKHNdnb25MDSuzV7c4JfZHQ3kh6bvLtjJwrWRJvs5Zu8P9_PpE5-9Pj5Pb2d8hUIPXPv0FfnFAki7wlVOVqAq0MZoMlXlpZSFKsCUlfGogGpyICuqixKx1tLhmF3t7q5c9K5dBNf5JtpVaL5d-LOiUEYoiSmX73IxWd0HBVv1_Ve0AuwGpE3ELNqExm6h2Q3ItIT746H_WVMcLG22PHVDcK1futVAIVoErUVpbJ5aAf4DKq9vzA</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>Esponda, Fernando</creator><creator>Forrest, Stephanie</creator><creator>Helman, Paul</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2003</creationdate><title>The Crossover Closure and Partial Match Detection</title><author>Esponda, Fernando ; Forrest, Stephanie ; Helman, Paul</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p318t-8c334ecff0e8a5aba4b06b08998e9bbc444565097b9c360edea04bed5733d84a3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Computer science; control theory; systems</topic><topic>Concept Drift</topic><topic>Crossover Operator</topic><topic>Detection Scheme</topic><topic>Directed Acyclic Graph</topic><topic>Exact sciences and technology</topic><topic>Match Rule</topic><topic>Pattern recognition. Digital image processing. Computational geometry</topic><topic>Software</topic><topic>Speech and sound recognition and synthesis. Linguistics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Esponda, Fernando</creatorcontrib><creatorcontrib>Forrest, Stephanie</creatorcontrib><creatorcontrib>Helman, Paul</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Esponda, Fernando</au><au>Forrest, Stephanie</au><au>Helman, Paul</au><au>Hart, Emma</au><au>Bentley, Peter</au><au>Timmis, Jon</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>The Crossover Closure and Partial Match Detection</atitle><btitle>Artificial Immune Systems</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2003</date><risdate>2003</risdate><volume>2787</volume><spage>249</spage><epage>260</epage><pages>249-260</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540407669</isbn><isbn>9783540407669</isbn><eisbn>9783540451921</eisbn><eisbn>3540451927</eisbn><abstract>The crossover closure generation rule characterizes the generalization achieved by artificial immune systems using partial match detection. The paper reviews earlier results and extends the previously introduced notion of crossover closure to encompass additional match rules. For concreteness, the discussion focuses on r-chunks matching, giving alternative ways that detectors can be used to implement the crossover closure.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/978-3-540-45192-1_24</doi><oclcid>934980476</oclcid><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Artificial Immune Systems, 2003, Vol.2787, p.249-260 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_15691643 |
| source | Springer Books |
| subjects | Applied sciences Artificial intelligence Computer science control theory systems Concept Drift Crossover Operator Detection Scheme Directed Acyclic Graph Exact sciences and technology Match Rule Pattern recognition. Digital image processing. Computational geometry Software Speech and sound recognition and synthesis. Linguistics |
| title | The Crossover Closure and Partial Match Detection |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-12T16%3A31%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=The%20Crossover%20Closure%20and%20Partial%20Match%20Detection&rft.btitle=Artificial%20Immune%20Systems&rft.au=Esponda,%20Fernando&rft.date=2003&rft.volume=2787&rft.spage=249&rft.epage=260&rft.pages=249-260&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540407669&rft.isbn_list=9783540407669&rft_id=info:doi/10.1007/978-3-540-45192-1_24&rft_dat=%3Cproquest_pasca%3EEBC3088179_29_260%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540451921&rft.eisbn_list=3540451927&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3088179_29_260&rft_id=info:pmid/&rfr_iscdi=true |