<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-03-09T23:55:30Z</responseDate>
  <request verb="GetRecord" metadataPrefix="oai_dc" identifier="oai:bunkyo.repo.nii.ac.jp:00003387">https://bunkyo.repo.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:bunkyo.repo.nii.ac.jp:00003387</identifier>
        <datestamp>2024-08-08T01:03:53Z</datestamp>
        <setSpec>1:26:195</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>キゾク ケイスウホウ ニ モトズク ルイジド キゾク カンケイ アイマイド ニンシキ ジョウホウリョウ ノ ケイサンキ シミュレーション</dc:title>
          <dc:title>帰属係数法に基づく類似度,帰属関係あいまい度,認識情報量の計算機シミュレーション</dc:title>
          <dc:title>Similarity, Membership Equivocation and Amount of Recognitive Information Relating to Membership Coefficient Method and its Computer Simulation</dc:title>
          <dc:creator>鈴木, 昇一</dc:creator>
          <dc:description>We point out three following matters : ( 1 ) It does not necessarily follow that a similarity-measure is defined between two any patterns. ( 2 ) The measure have only to be defined between any pattern and a typical pattern of any category. ( 3 ) The measure have to be defined using a perceptual representation of any pattern, that is, a model of any pattern.
　It is the purpose of the present paper to propose by the use of membership-coefficients the measure which satisfies three above matters and to compute by means of a computer simulation membership-equivocations and amounts of recognitive information of isolated Japanese vowels as input patterns. The equivocation is defined as an entropy function of the measure, and the amount as a Kullback discriminant function of the measure.
　We pay attention to the following request : An amount of selfinformation must be obtained as a logarithmic function of the reciprocal of an occurrence-probability of a category if a system recognizes that an input pattern belongs to the category. The request can be explained sufficiently with such an amount of recognitive information.</dc:description>
          <dc:description>departmental bulletin paper</dc:description>
          <dc:publisher>文教大学</dc:publisher>
          <dc:date>1990-01-01</dc:date>
          <dc:type>VoR</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>情報研究</dc:identifier>
          <dc:identifier>11</dc:identifier>
          <dc:identifier>51</dc:identifier>
          <dc:identifier>68</dc:identifier>
          <dc:identifier>Information and Communication Studies</dc:identifier>
          <dc:identifier>03893367</dc:identifier>
          <dc:identifier>https://bunkyo.repo.nii.ac.jp/record/3387/files/BKSJ110005.pdf</dc:identifier>
          <dc:identifier>https://bunkyo.repo.nii.ac.jp/records/3387</dc:identifier>
          <dc:language>jpn</dc:language>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
