<?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-09T03:38:45Z</responseDate>
  <request verb="GetRecord" identifier="oai:barrel.repo.nii.ac.jp:00004579" metadataPrefix="jpcoar_1.0">https://barrel.repo.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:barrel.repo.nii.ac.jp:00004579</identifier>
        <datestamp>2025-03-17T00:21:57Z</datestamp>
        <setSpec>1:536</setSpec>
        <setSpec>4</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 xml:lang="en">Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables</dc:title>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Haraguchi, Kazuya</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Hong, Seok-Hee</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Nagamochi, Hiroshi</jpcoar:creatorName>
          </jpcoar:creator>
          <dc:rights xml:lang="ja">http://link.springer.com/chapter/10.1007%2F978-3-642-13800-3_13</dc:rights>
          <dc:rights xml:lang="en">The original publication is available at www.springerlink.com</dc:rights>
          <jpcoar:subject xml:lang="ja" subjectScheme="NDC">007</jpcoar:subject>
          <jpcoar:subject xml:lang="ja" subjectScheme="Other">情報学</jpcoar:subject>
          <datacite:description xml:lang="en" descriptionType="Abstract">In this paper, we consider K-class classification problem, a significant issue in machine learning or artificial intelligence. In this problem, we are given a training set of samples, where each sample is represented by a nominal-valued vector and is labeled as one of the predefined K classes. The problem asks to construct a classifier that predicts the classes of future samples with high accuracy. For K = 2, we have studied a new visual classifier named 2-class SE-graph based classifier (2-SEC) in our previous works, which is constructed as follows: We first create several decision tables from the training set and extract a bipartite graph called an SE-graph that represents the relationship between the training set and the decision tables. We draw the SE-graph as a twolayered drawing by using an edge crossing minimization technique, and the resulting drawing acts as a visual classifier. We can extend 2-SEC to K-SEC for K &gt; 2 naturally, but this extension does not consider the relationship between classes, and thus may perform badly on some data sets. In this paper, we propose SEC-TREE classifier for K &gt; 2, which decomposes the given K-class problem into subproblems for fewer classes. Following our philosophy, we employ edge crossing minimization technique for this decomposition. Compared to previous decomposition strategies, SEC-TREE can extract any tree as the subproblem hierarchy. In computational studies, SEC-TREE outperforms C4.5 and is competitive with SVM especially when K is large.</datacite:description>
          <dc:publisher xml:lang="en">Springer Berlin Heidelberg</dc:publisher>
          <datacite:date dateType="Issued">2010</datacite:date>
          <dc:language>eng</dc:language>
          <dc:type rdf:resource="http://purl.org/coar/resource_type/c_6501">journal article</dc:type>
          <oaire:version rdf:resource="http://purl.org/coar/version/c_ab4af688f83e57aa">AM</oaire:version>
          <jpcoar:identifier identifierType="HDL">http://hdl.handle.net/10252/5198</jpcoar:identifier>
          <jpcoar:identifier identifierType="URI">https://barrel.repo.nii.ac.jp/records/4579</jpcoar:identifier>
          <jpcoar:relation relationType="isVersionOf">
            <jpcoar:relatedIdentifier identifierType="DOI">info:doi/10.1007/978-3-642-13800-3_13</jpcoar:relatedIdentifier>
          </jpcoar:relation>
          <jpcoar:sourceIdentifier identifierType="PISSN">0302-9743</jpcoar:sourceIdentifier>
          <jpcoar:sourceTitle xml:lang="en">Lecture Notes in Computer Science</jpcoar:sourceTitle>
          <jpcoar:volume>6073</jpcoar:volume>
          <jpcoar:pageStart>169</jpcoar:pageStart>
          <jpcoar:pageEnd>183</jpcoar:pageEnd>
          <jpcoar:file>
            <jpcoar:URI label="Proc.LION4(LNCS 6073)_169-183.pdf">https://barrel.repo.nii.ac.jp/record/4579/files/Proc.LION4(LNCS 6073)_169-183.pdf</jpcoar:URI>
            <jpcoar:mimeType>application/pdf</jpcoar:mimeType>
            <jpcoar:extent>732.6 kB</jpcoar:extent>
            <datacite:date dateType="Available">2016-01-26</datacite:date>
          </jpcoar:file>
        </jpcoar:jpcoar>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
