<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE ep-patent-document PUBLIC "-//EPO//EP PATENT DOCUMENT 1.4//EN" "ep-patent-document-v1-4.dtd"><!-- Disclaimer: This ST.36 XML data has been generated from A2/A1 XML data enriched with the publication date of the A3 document - March 2013 - EPO - Directorate Publication - kbaumeister@epo.org --><ep-patent-document id="EP94306325A3" file="EP94306325NWA3.xml" lang="en" doc-number="0640935" date-publ="19950503" kind="A3" country="EP" status="N" dtd-version="ep-patent-document-v1-4"><SDOBI lang="en"><B000><eptags><B001EP>......DE....FRGB..................................</B001EP><B005EP>J</B005EP></eptags></B000><B100><B110>0640935</B110><B120><B121>EUROPEAN PATENT APPLICATION</B121></B120><B130>A3</B130><B140><date>19950503</date></B140><B190>EP</B190></B100><B200><B210>94306325.5</B210><B220><date>19940826</date></B220><B240 /><B250>en</B250><B251EP>en</B251EP><B260>en</B260></B200><B300><B310>211386/93</B310><B320><date>19930826</date></B320><B330><ctry>JP</ctry></B330></B300><B400><B405><date>19950503</date><bnum>199518</bnum></B405><B430><date>19950301</date><bnum>199509</bnum></B430></B400><B500><B510><B516>6</B516><B511> 6G 06K   9/66   A</B511></B510><B540><B541>de</B541><B542>Mustenerkennung durch neuronales Netzwerk</B542><B541>en</B541><B542>Pattern recognition using a neural network</B542><B541>fr</B541><B542>Reconnaissance de formes par réseau neuronal</B542></B540><B560 /><B590><B598>2</B598></B590></B500><B700><B710><B711><snm>International Business Machines
Corporation</snm><iid>00200120</iid><irf>JA9-93-527/JPR</irf><adr><str>Old Orchard Road</str><city>Armonk, N.Y. 10504</city><ctry>US</ctry></adr></B711></B710><B720><B721><snm>Fujita, Masayuki</snm><adr><str>1-1-23-1301, Seishin-cho</str><city>Edogawa-ku,
Tokyo 134</city><ctry>JP</ctry></adr></B721><B721><snm>Toyokawa, Kazuharu</snm><adr><str>2-17-1, chuo-Rinkan</str><city>Yamato-shi,
Kanagawa-ken 242</city><ctry>JP</ctry></adr></B721><B721><snm>Katoh, Shin</snm><adr><str>2-27-8, Honan</str><city>Suginami-ku,
Tokyo, 168</city><ctry>JP</ctry></adr></B721></B720><B740><B741><snm>Bailey, Geoffrey Alan</snm><iid>00027921</iid><adr><str>IBM United Kingdom Limited
Intellectual Property Department
Hursley Park</str><city>Winchester
Hampshire SO21 2JN</city><ctry>GB</ctry></adr></B741></B740></B700><B800><B840><ctry>DE</ctry><ctry>FR</ctry><ctry>GB</ctry></B840><B880><date>19950503</date><bnum>199518</bnum></B880></B800></SDOBI><abstract id="abst" lang="en"><p id="pa01" num="0001">An interval [0, 1] of the output of neural network is equally divided into M (M being an integer of two or more), and the numbers or frequencies of data for the correct/incorrect patterns contained in the i-th interval [(i - 1)/M, i/M] are µ1i and µ0i, respectively (where, i = 1 ... M). In this case, if this network provides an output contained in the i-th interval to unknown pattern data, this pattern is stored as a likelihood conversion table so that the pattern outputs likelihood P1i, which is a category, in an equation P1i = (µ1i + 1)/(µ1i + µ0i + 2). Then, when a value contained in the i-th interval [(i - 1)/M, i/M] is output from a neural network, the likelihood convertor receives it as an input and outputs P1i which is so to speak normalized likelihood.</p><p id="pa02" num="0002">Because the intervention of such likelihood convertor makes it possible for each network to be adjusted to output likelihood, the variation of learning is corrected for the networks so that the output from each network can be compared with each other. That is, a category provided the highest likelihood can be determined to be the most probable candidate.<img id="iaf01" file="imgaf001.tif" wi="76" he="55" img-content="drawing" img-format="tif" /></p></abstract><search-report-data id="srep" srep-office="EP" date-produced="" lang=""><doc-page id="srep0001" file="srep0001.tif" type="tif" orientation="portrait" he="297" wi="210" /></search-report-data></ep-patent-document>