A Finite-Memory Adaptive Pattern Recognizer
This paper gives an adaptive procedure for selecting a discriminant for a pattern recognizer. The optimum discriminant is selected from a given finite set of discriminants. The selection of this set itself is not considered here. At any stage the optimum discriminant is selected on the basis of the...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on systems science and cybernetics 1968-01, Vol.4 (1), p.2-11 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 11 |
|---|---|
| container_issue | 1 |
| container_start_page | 2 |
| container_title | IEEE transactions on systems science and cybernetics |
| container_volume | 4 |
| creator | Irani, Keki B. |
| description | This paper gives an adaptive procedure for selecting a discriminant for a pattern recognizer. The optimum discriminant is selected from a given finite set of discriminants. The selection of this set itself is not considered here. At any stage the optimum discriminant is selected on the basis of the past observations. Since the storage space for these observations is assumed to be limited, and hence the qualifier finite memory, the information stored about these past observations is judiciously selected. No other a priori knowledge is assumed. A mathematical model of the problem of pattern recognition is constructed and several theorems are proved. With the help of these theorems, the adaptive procedure is developed. This adaptive procedure is, in effect, a method of using the finite memory efficiently in "training" the pattern recognizer. |
| doi_str_mv | 10.1109/TSSC.1968.300181 |
| format | Article |
| fullrecord | <record><control><sourceid>crossref_RIE</sourceid><recordid>TN_cdi_ieee_primary_4082110</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4082110</ieee_id><sourcerecordid>10_1109_TSSC_1968_300181</sourcerecordid><originalsourceid>FETCH-LOGICAL-c305t-28aa1883fb21fbaccf8f22f23aa4560432aa459439990cfda0ec6a5be727e033</originalsourceid><addsrcrecordid>eNo9j0tLxDAUhYMoWEf3gpvupfXepE3TZSnOKIwoTvchzdxIxGmHtAjjr7el4uqcxXnwMXaLkCJC-dDsdnWKpVSpAECFZyziKFXClSrOWQS5kAnmsrhkV8PwCSBAYhax-ype-86PlLzQoQ-nuNqb4-i_KX4z40ihi9_J9h-d_6FwzS6c-Rro5k9XrFk_NvVTsn3dPNfVNrEC8nF6NAaVEq7l6FpjrVOOc8eFMVkuIRN8NmUmyrIE6_YGyEqTt1TwgkCIFYNl1oZ-GAI5fQz-YMJJI-iZVc-sembVC-tUuVsqnoj-4xkoPuXFLx-BT2E</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Finite-Memory Adaptive Pattern Recognizer</title><source>IEEE Electronic Library (IEL)</source><creator>Irani, Keki B.</creator><creatorcontrib>Irani, Keki B.</creatorcontrib><description>This paper gives an adaptive procedure for selecting a discriminant for a pattern recognizer. The optimum discriminant is selected from a given finite set of discriminants. The selection of this set itself is not considered here. At any stage the optimum discriminant is selected on the basis of the past observations. Since the storage space for these observations is assumed to be limited, and hence the qualifier finite memory, the information stored about these past observations is judiciously selected. No other a priori knowledge is assumed. A mathematical model of the problem of pattern recognition is constructed and several theorems are proved. With the help of these theorems, the adaptive procedure is developed. This adaptive procedure is, in effect, a method of using the finite memory efficiently in "training" the pattern recognizer.</description><identifier>ISSN: 0536-1567</identifier><identifier>EISSN: 2168-2887</identifier><identifier>DOI: 10.1109/TSSC.1968.300181</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Bismuth ; Error correction ; Mathematical model ; Noise level ; Pattern recognition ; Radiofrequency interference ; Senior members ; Signal mapping ; Systems engineering and theory</subject><ispartof>IEEE transactions on systems science and cybernetics, 1968-01, Vol.4 (1), p.2-11</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c305t-28aa1883fb21fbaccf8f22f23aa4560432aa459439990cfda0ec6a5be727e033</citedby><cites>FETCH-LOGICAL-c305t-28aa1883fb21fbaccf8f22f23aa4560432aa459439990cfda0ec6a5be727e033</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4082110$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4082110$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Irani, Keki B.</creatorcontrib><title>A Finite-Memory Adaptive Pattern Recognizer</title><title>IEEE transactions on systems science and cybernetics</title><addtitle>TSSC</addtitle><description>This paper gives an adaptive procedure for selecting a discriminant for a pattern recognizer. The optimum discriminant is selected from a given finite set of discriminants. The selection of this set itself is not considered here. At any stage the optimum discriminant is selected on the basis of the past observations. Since the storage space for these observations is assumed to be limited, and hence the qualifier finite memory, the information stored about these past observations is judiciously selected. No other a priori knowledge is assumed. A mathematical model of the problem of pattern recognition is constructed and several theorems are proved. With the help of these theorems, the adaptive procedure is developed. This adaptive procedure is, in effect, a method of using the finite memory efficiently in "training" the pattern recognizer.</description><subject>Bandwidth</subject><subject>Bismuth</subject><subject>Error correction</subject><subject>Mathematical model</subject><subject>Noise level</subject><subject>Pattern recognition</subject><subject>Radiofrequency interference</subject><subject>Senior members</subject><subject>Signal mapping</subject><subject>Systems engineering and theory</subject><issn>0536-1567</issn><issn>2168-2887</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1968</creationdate><recordtype>article</recordtype><recordid>eNo9j0tLxDAUhYMoWEf3gpvupfXepE3TZSnOKIwoTvchzdxIxGmHtAjjr7el4uqcxXnwMXaLkCJC-dDsdnWKpVSpAECFZyziKFXClSrOWQS5kAnmsrhkV8PwCSBAYhax-ype-86PlLzQoQ-nuNqb4-i_KX4z40ihi9_J9h-d_6FwzS6c-Rro5k9XrFk_NvVTsn3dPNfVNrEC8nF6NAaVEq7l6FpjrVOOc8eFMVkuIRN8NmUmyrIE6_YGyEqTt1TwgkCIFYNl1oZ-GAI5fQz-YMJJI-iZVc-sembVC-tUuVsqnoj-4xkoPuXFLx-BT2E</recordid><startdate>19680101</startdate><enddate>19680101</enddate><creator>Irani, Keki B.</creator><general>IEEE</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19680101</creationdate><title>A Finite-Memory Adaptive Pattern Recognizer</title><author>Irani, Keki B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c305t-28aa1883fb21fbaccf8f22f23aa4560432aa459439990cfda0ec6a5be727e033</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1968</creationdate><topic>Bandwidth</topic><topic>Bismuth</topic><topic>Error correction</topic><topic>Mathematical model</topic><topic>Noise level</topic><topic>Pattern recognition</topic><topic>Radiofrequency interference</topic><topic>Senior members</topic><topic>Signal mapping</topic><topic>Systems engineering and theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Irani, Keki B.</creatorcontrib><collection>CrossRef</collection><jtitle>IEEE transactions on systems science and cybernetics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Irani, Keki B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Finite-Memory Adaptive Pattern Recognizer</atitle><jtitle>IEEE transactions on systems science and cybernetics</jtitle><stitle>TSSC</stitle><date>1968-01-01</date><risdate>1968</risdate><volume>4</volume><issue>1</issue><spage>2</spage><epage>11</epage><pages>2-11</pages><issn>0536-1567</issn><eissn>2168-2887</eissn><abstract>This paper gives an adaptive procedure for selecting a discriminant for a pattern recognizer. The optimum discriminant is selected from a given finite set of discriminants. The selection of this set itself is not considered here. At any stage the optimum discriminant is selected on the basis of the past observations. Since the storage space for these observations is assumed to be limited, and hence the qualifier finite memory, the information stored about these past observations is judiciously selected. No other a priori knowledge is assumed. A mathematical model of the problem of pattern recognition is constructed and several theorems are proved. With the help of these theorems, the adaptive procedure is developed. This adaptive procedure is, in effect, a method of using the finite memory efficiently in "training" the pattern recognizer.</abstract><pub>IEEE</pub><doi>10.1109/TSSC.1968.300181</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0536-1567 |
| ispartof | IEEE transactions on systems science and cybernetics, 1968-01, Vol.4 (1), p.2-11 |
| issn | 0536-1567 2168-2887 |
| language | eng |
| recordid | cdi_ieee_primary_4082110 |
| source | IEEE Electronic Library (IEL) |
| subjects | Bandwidth Bismuth Error correction Mathematical model Noise level Pattern recognition Radiofrequency interference Senior members Signal mapping Systems engineering and theory |
| title | A Finite-Memory Adaptive Pattern Recognizer |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T16%3A48%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Finite-Memory%20Adaptive%20Pattern%20Recognizer&rft.jtitle=IEEE%20transactions%20on%20systems%20science%20and%20cybernetics&rft.au=Irani,%20Keki%20B.&rft.date=1968-01-01&rft.volume=4&rft.issue=1&rft.spage=2&rft.epage=11&rft.pages=2-11&rft.issn=0536-1567&rft.eissn=2168-2887&rft_id=info:doi/10.1109/TSSC.1968.300181&rft_dat=%3Ccrossref_RIE%3E10_1109_TSSC_1968_300181%3C/crossref_RIE%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=4082110&rfr_iscdi=true |