<?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-04-17T11:28:46Z</responseDate>
  <request verb="GetRecord" metadataPrefix="oai_dc" identifier="oai:ipsj.ixsq.nii.ac.jp:00107197">https://ipsj.ixsq.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ipsj.ixsq.nii.ac.jp:00107197</identifier>
        <datestamp>2025-01-21T09:07:33Z</datestamp>
        <setSpec>934:989:7531:7705</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>Compact Genetic Algorithmを導入した学習分類子システムによる分類子数の削減</dc:title>
          <dc:title>Rule Reduction in Learning Classifier System Using Compact Genetic Algorithm</dc:title>
          <dc:creator>中田, 雅也</dc:creator>
          <dc:creator>ピエール・ルカ・ランチ</dc:creator>
          <dc:creator>田島, 友祐</dc:creator>
          <dc:creator>高玉, 圭樹</dc:creator>
          <dc:creator>Masaya, Nakata</dc:creator>
          <dc:creator>Pier, LucaLanzi</dc:creator>
          <dc:creator>Yusuke, Tajima</dc:creator>
          <dc:creator>Keiki, Takadama</dc:creator>
          <dc:subject>[オリジナル論文] 学習分類子システム，遺伝的アルゴリズム，確率モデル型遺伝的アルゴリズム</dc:subject>
          <dc:description>本論文では，学習分類子システム（Learning Classifier System: LCS）において，学習する分類子数を削減するために，Compact Genetic Algorithmを用いた確率モデル型分類子生成法を提案する．提案分類子生成法は，1)分類子が持つ部分解の存在確率をモデル化することで不要な分類子の生成を抑制し，2) 従来の確率モデル型分類子生成法が適用困難であった強化学習問題クラスに適用可能である．教師あり学習問題（Multiplexer問題）と強化学習問題（Grid world問題）において，提案分類子生成法を導入したLCSを適用したところ，次の知見を得た．まず，1)提案LCSは従来LCSよりも，少ない学習回数で最適解を学習可能であり，2)従来LCSが学習した分類子数に対し，提案LCSは最小でも49%（最大で76%）削減した分類子数で学習可能であることを示した．したがって，提案分類子生成法は，最適解を持つ分類子を早期に生成可能であり，不要な分類子の生成を抑制可能であることを示した．</dc:description>
          <dc:description>This paper proposes a novel probability model based rule-discovery mechanism using Compact Genetic Algorithm for Learning Classifier System (LCS), which evolves classifiers based on an extracted attribute of classifier conditions, to reduce a size of classifiers are needed in LCS. The proposed rule-discovery mechanism can 1) generate good classifiers that conditions have good building blocks; and 2) solve both single-step problems and multi-step problems where conventional probability-model based rule discovery mechanisms are hard to be applied. This paper applies LCS with the proposed rule-discovery mechanism to both a single-step problem (the multiplexer problem) and a multi-step problem (the grid world problem). Experimental results show following implications: 1) the proposed LCS can reach optimal performances faster than a conventional LCS; and 2) it can reduce the size of classifiers by at least 49% of that of the conventional LCS. Our conclusion is that the proposed rule-discovery mechanism can generate optimal classifiers with fewer generations than the conventional rule-discovery mechanism, and that it can control generating inaccurate classifiers toward the rule reduction.</dc:description>
          <dc:description>journal article</dc:description>
          <dc:publisher>情報処理学会</dc:publisher>
          <dc:date>2014-11-27</dc:date>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>情報処理学会論文誌数理モデル化と応用（TOM）</dc:identifier>
          <dc:identifier>2</dc:identifier>
          <dc:identifier>7</dc:identifier>
          <dc:identifier>1</dc:identifier>
          <dc:identifier>16</dc:identifier>
          <dc:identifier>1882-7780</dc:identifier>
          <dc:identifier>AA11464803</dc:identifier>
          <dc:identifier>https://ipsj.ixsq.nii.ac.jp/record/107197/files/IPSJ-TOM0702002.pdf</dc:identifier>
          <dc:language>jpn</dc:language>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
