<?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-10-01T14:07:38Z</responseDate>
  <request verb="GetRecord" identifier="oai:dcpapers.dublincore.org:952677270" metadataPrefix="oai_dc">https://dcpapers.dublincore.org/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:dcpapers.dublincore.org:952677270</identifier>
        <datestamp>2026-09-10</datestamp>
        <setSpec>dcmi-2026</setSpec>
        <setSpec>openaire</setSpec>
      </header>
      <metadata>
    <oai_dc:dc
        xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
        xmlns:dc="http://purl.org/dc/elements/1.1/"
        xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
        xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/
        http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
      <dc:title>From Notes to Knowledge Management: Representing KDC Classification Notes as Linked Data for Automated Classification</dc:title>
      <dc:creator>Park, Haeryung</dc:creator>
      <dc:creator>Lee, Seungmin</dc:creator>
      <dc:description>This study reinterprets classification notes in the Korean Decimal Classification (KDC) as key semantic elements for automated classification and proposes a method for structuring relationships among classification entries. Existing approaches have relied on keyword-based analysis or simple mapping, limiting their ability to reflect the intellectual structure of classification systems. To address this limitation, this study analyzes the types and functions of KDC notes and identifies their roles in expressing semantic relationships, such as conceptual definition, hierarchical and associative links, subdivision rules, and exceptions. These relationships are then categorized into internal and external relations and formalized as properties within a linked data framework. This approach enables the transformation of unstructured notes into machine-processable structures and supports the development of semantically enriched, knowledge graph–based classification systems.</dc:description>
      <dc:publisher>Dublin Core Metadata Initiative</dc:publisher>
      <dc:date>2026-09-10</dc:date>
      <dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
      <dc:type>Text</dc:type>
      <dc:format>application/pdf</dc:format>
      <dc:format>text/html</dc:format>
      <dc:identifier>https://doi.org/10.23106/dcmi.952677270</dc:identifier>
      <dc:identifier>https://dcpapers.dublincore.org/article/952677270</dc:identifier>
      <dc:source>Dublin Core Metadata Initiative Conference Proceedings</dc:source>
      <dc:language>eng</dc:language>
      <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
      <dc:rights>https://creativecommons.org/licenses/by/4.0/</dc:rights>
    </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>