<?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-14T14:10:52Z</responseDate>
  <request metadataPrefix="jpcoar_1.0" verb="GetRecord" identifier="oai:ipsj.ixsq.nii.ac.jp:00209011">https://ipsj.ixsq.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ipsj.ixsq.nii.ac.jp:00209011</identifier>
        <datestamp>2025-01-19T15:04:17Z</datestamp>
        <setSpec>581:10433:10434</setSpec>
      </header>
      <metadata>
        <jpcoar:jpcoar xmlns:datacite="https://schema.datacite.org/meta/kernel-4/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcndl="http://ndl.go.jp/dcndl/terms/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:jpcoar="https://github.com/JPCOAR/schema/blob/master/1.0/" xmlns:oaire="http://namespace.openaire.eu/schema/oaire/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:rioxxterms="http://www.rioxx.net/schema/v2.0/rioxxterms/" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns="https://github.com/JPCOAR/schema/blob/master/1.0/" xsi:schemaLocation="https://github.com/JPCOAR/schema/blob/master/1.0/jpcoar_scm.xsd">
          <dc:title>グラフを用いたNMFの地域分散高速化</dc:title>
          <dc:title xml:lang="en">Graph-based Regional NMF for Distributed Computing</dc:title>
          <jpcoar:creator>
            <jpcoar:creatorName>越塚, 毅</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>竹内, 孝</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>松林, 達史</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>澤田, 宏</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Koshizuka, Takeshi</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Koh, Takeuchi</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Tatsushi, Matsubayashi</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Hiroshi, Sawada</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:subject subjectScheme="Other">[一般論文（推薦論文）] 行列分解，並列化，分散処理</jpcoar:subject>
          <datacite:description descriptionType="Other">集計データに対する教師なしのパターン認識技術として，Non-negative Matrix Factorization（NMF）は広く使われている．特にNon-negative Multiple Matrix Factorization（NMMF）では，複数のデータから共通する項目を共通因子として扱い，効果的に同時分解を行う．本研究では共通因子に加え，地域性などの物理的な関係性を持つ集計データに焦点を当て，因子分解を行うrNMF（regional Non-negative Matrix Factorization）を提案する．rNMFは，物理的に距離の近い地域のデータは同様の特徴空間で表現し，分析結果をより直感的に分かりやすいものとする．なお，地域の位置関係はグラフによって与える．さらに分析対象のデータが大規模な行列であっても，グラフの彩色問題をヒューリスティックに解くことで，分散システム上で高速に処理を行える．本稿では，まずrNMFをNMFの拡張として定式化を行い，パラメータ更新法も示す．地域ごとに集計された実データを用いた実験では，rNMFを用いることで，隣接した地域データを共通した特徴空間で表現できること，従来のNMFに対して汎化性能が悪化しないこと，分散システム上で高速に動作することを示す．</datacite:description>
          <datacite:description descriptionType="Other">Non-negative Matrix Factorization (NMF) is a popular unsupervised pattern recognition technique for the analysis of aggregated data. In particular, Non-negative Multiple Matrix Factorization (NMMF) treats common elements from multiple data as common factors, and execute simultaneous decomposition effectively. In this study, we propose a novel matrix factorization method called regional Non-negative Matrix Factorization (rNMF), which factorises multiple matrics simultaneously, focusing on physical relation between aggregated data such as regional characteristics in addition to common factors. rNMF expresses data of physically close areas in a similar feature space, and extracts intuitively interpretable bases and coefficients from multiple matrics. The information of regional location is given by a graph. Furthermore, by solving the graph coloring problem heuristically, rNMF works at high speed on a distributed system even if the analyzed data are large matrices. In this paper, we formulate rNMF as an extended version of NMF and derive multiplicative update rules for parameter estimation. We performed experiment with real data, which were aggregated by region, in order to verify that rNMF can expresses adjacent regional data in a common feature, rNMF attained similar generalization performance as the original NMF, and rNMF works at high speed on a distributed system.</datacite:description>
          <datacite:date dateType="Issued">2021-01-15</datacite:date>
          <dc:language>jpn</dc:language>
          <dc:type rdf:resource="http://purl.org/coar/resource_type/c_6501">journal article</dc:type>
          <jpcoar:identifier identifierType="DOI">https://doi.org/10.20729/00208909</jpcoar:identifier>
          <jpcoar:identifier identifierType="URI">https://ipsj.ixsq.nii.ac.jp/records/209011</jpcoar:identifier>
          <jpcoar:identifierRegistration identifierType="JaLC">10.20729/00208909</jpcoar:identifierRegistration>
          <jpcoar:sourceIdentifier identifierType="ISSN">1882-7764</jpcoar:sourceIdentifier>
          <jpcoar:sourceIdentifier identifierType="NCID">AN00116647</jpcoar:sourceIdentifier>
          <jpcoar:sourceTitle>情報処理学会論文誌</jpcoar:sourceTitle>
          <jpcoar:volume>62</jpcoar:volume>
          <jpcoar:issue>1</jpcoar:issue>
          <jpcoar:pageStart>387</jpcoar:pageStart>
          <jpcoar:pageEnd>396</jpcoar:pageEnd>
          <jpcoar:file>
            <jpcoar:URI label="IPSJ-JNL6201046.pdf">https://ipsj.ixsq.nii.ac.jp/record/209011/files/IPSJ-JNL6201046.pdf</jpcoar:URI>
            <jpcoar:mimeType>application/pdf</jpcoar:mimeType>
            <jpcoar:extent>2.6 MB</jpcoar:extent>
            <datacite:date dateType="Available">2023-01-15</datacite:date>
          </jpcoar:file>
        </jpcoar:jpcoar>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
