<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/116">
    <title>Repository Collection: null</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/116</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="https://scholar.dgist.ac.kr/handle/20.500.11750/47777" />
        <rdf:li rdf:resource="https://scholar.dgist.ac.kr/handle/20.500.11750/47123" />
        <rdf:li rdf:resource="https://scholar.dgist.ac.kr/handle/20.500.11750/47102" />
        <rdf:li rdf:resource="https://scholar.dgist.ac.kr/handle/20.500.11750/47039" />
      </rdf:Seq>
    </items>
    <dc:date>2026-04-05T16:40:42Z</dc:date>
  </channel>
  <item rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/47777">
    <title>A BERT-enhanced Graph Neural Network for Knowledge Base Population</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/47777</link>
    <description>Title: A BERT-enhanced Graph Neural Network for Knowledge Base Population
Author(s): Lim, Heechul; Kim, Min-Soo
Abstract: We present BGKBP, a deep-learning algorithm based on BERT, and a graph neural network for knowledge base population (KBP). Our experiments showed that a straightforward application of BERT and GNN on a large knowledge base (e.g., Wikidata) improves KBP quality and outperforms the previous state-of-the-art methods. We developed four techniques to improve the BGKBP&amp;apos;s KBP capability: (1) serialization, (2) fine-tuning, (3) node regression, and (4) text augmentation. BGKBP achieved the best F1 scores of 0.723 and 0.495 on entity linking and new entity detection, respectively. We further showed that using text augmentation (BGKBP-TA) achieved the best F1 score of 0.547 on relation linking, which is more difficult than entity linking because of the various representations of some of the relations. © 2023 IEEE.</description>
    <dc:date>2023-02-13T15:00:00Z</dc:date>
  </item>
  <item rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/47123">
    <title>Toward Mission Critical A.I. Systems</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/47123</link>
    <description>Title: Toward Mission Critical A.I. Systems
Author(s): Kim, Min-Soo</description>
    <dc:date>2017-10-18T15:00:00Z</dc:date>
  </item>
  <item rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/47102">
    <title>Big data technology for designing high-quality oligonucleotides without off-target effects</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/47102</link>
    <description>Title: Big data technology for designing high-quality oligonucleotides without off-target effects
Author(s): Kim, Min-Soo</description>
    <dc:date>2017-11-01T15:00:00Z</dc:date>
  </item>
  <item rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/47039">
    <title>A Distributed and Parallel Graph Processing and Generating Methods for Trillion-scale Graphs</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/47039</link>
    <description>Title: A Distributed and Parallel Graph Processing and Generating Methods for Trillion-scale Graphs
Author(s): Kim, Min-Soo</description>
    <dc:date>2017-11-17T15:00:00Z</dc:date>
  </item>
</rdf:RDF>

