<?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-15T15:06:25Z</responseDate>
  <request metadataPrefix="oai_dc" verb="GetRecord" identifier="oai:ipsj.ixsq.nii.ac.jp:00207911">https://ipsj.ixsq.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ipsj.ixsq.nii.ac.jp:00207911</identifier>
        <datestamp>2025-01-19T19:00:30Z</datestamp>
        <setSpec>1164:2592:10084:10406</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>Distributed Algorithms based on Multiplicative Update Rules for Nonnegative Matrix Factorization</dc:title>
          <dc:creator>道免, 陽平</dc:creator>
          <dc:creator>右田, 剛史</dc:creator>
          <dc:creator>高橋, 規一</dc:creator>
          <dc:creator>Yohei, Domen</dc:creator>
          <dc:creator>Tsuyoshi, Migita</dc:creator>
          <dc:creator>Norikazu, Takahashi</dc:creator>
          <dc:description>非負値行列因子分解 (NMF: Nonnegative Matrix Factorization) は，与えられた非負値行列を二つの低ランク非負値行列の積で近似する多変量解析の手法であり，信号処理，テキスト分類，ネットワーク分析，推薦システムなどに広く利用されている．本報告では，与えられた非負値行列が多数のブロックに分割され，各ブロックが一つのエージェントに割り当てられている状況を想定し，多数のエージェントが分散的かつ協調的に NMF を行うためのアルゴリズムを提案する．提案アルゴリズムは様々な乗法型更新とある合意アルゴリズムを組み合わせたものであり，単一エージェントで乗法型更新を実行するのと同じ結果が得られる点に特徴がある．</dc:description>
          <dc:description>Nonnegative matrix factorization (NMF) is a multivariate method that approximates a given nonnegative matrix by the product of two low-rank nonnegative matrices, and has been widely used in signal processing, text classiﬁcation, network analysis, and recommendation systems. In this report, assuming that a given nonnegative matrix is divided into a large number of blocks and each block is assigned to a single agent, we propose an algorithm for multiple agents to perform NMF in a decentralized and cooperative manner. The proposed algorithm, which is a combination of various multiplicative updates and a certain consensus algorithm, gives the same results as performing multiplicative updates with a single agent.</dc:description>
          <dc:description>technical report</dc:description>
          <dc:publisher>情報処理学会</dc:publisher>
          <dc:date>2020-11-18</dc:date>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>研究報告アルゴリズム（AL）</dc:identifier>
          <dc:identifier>9</dc:identifier>
          <dc:identifier>2020-AL-180</dc:identifier>
          <dc:identifier>1</dc:identifier>
          <dc:identifier>6</dc:identifier>
          <dc:identifier>2188-8566</dc:identifier>
          <dc:identifier>AN1009593X</dc:identifier>
          <dc:identifier>https://ipsj.ixsq.nii.ac.jp/record/207911/files/IPSJ-AL20180009.pdf</dc:identifier>
          <dc:language>jpn</dc:language>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
