<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Triple-based Similarity Propagation for Linked Data Matching</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Eun-kyung Kim</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sangha Nam</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jongseong Woo</string-name>
          <email>woo88@world.kaist.ac.kr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sejin Nam</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Key-Sun Choi</string-name>
          <email>kschoi@world.kaist.ac.kr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Computing</institution>
          ,
          <addr-line>KAIST</addr-line>
          ,
          <country>Republic of Korea</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper, we propose an approach for mapping properties in two RDF datasets between diferent languages, using a triplebased similarity propagation that can be adapted to find potential property matches. This approach does not need any language dependent information during the process, and thus can be applied to arbitrary languages without requiring translation.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Introduction
The proposed approach has two steps: 1) findings the equivalent subject and
object values across datasets at the entity-level, which is represented in the form
triples, that are connected by owl:sameAs links, and then considering the
associated properties to have the potential to be equivalent. 2) Then, using a small
number of identified matches as seeds to exploit the conceptual-level alignments
to identify and estimate semantic relatedness of properties. Often, the
conceptualizations of triples (from instance triples) are eficient in terms of coverage of
alignment, but their result may be dependent on recognizing entities and their
type. The types of an entity may not always be present in the dataset. The
‘similarity flooding approach’ [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] propagates the similarities between concepts to
refine the matching results. For example, two apparently diferent entities from
two ontologies are similar when their neighboring concepts are similar.
      </p>
      <p>Eun-kyung Kim et al.</p>
      <p>Experiments: The goal of this experiment is to align language-local properties
(i.e., DBpedia Korean property in this case) with the ontological properties of
DBpedia in English. Three human annotators aligned 1,000 DBKP to DBOP,
if the meaning of two properties was similar. We used the majority vote to
determine the correct mapping results.
Analysis: The preliminary experiment between the English and the Korean
DBpedia has shown that the propagated connectives improve the recall and
F1-score measures required to nfid mapping pairs of properties by taking into
account instance types in order to discover new mapping candidates. We see this
as the initial step towards enhancing multilingualism in Linked Open Data.
Acknowledgement This work was supported by Institute for Information
&amp; communications Technology Promotion(IITP) grant funded by the Korea
government(MSIP) (No. R0101-15-0054, WiseKB: Big data based self-evolving
knowledge base and reasoning platform)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Isele</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jakob</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jentzsch</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kontokostas</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mendes</surname>
            ,
            <given-names>P.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hellmann</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morsey</surname>
            , M., van Kleef,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>DBpedia - a largescale, multilingual knowledge base extracted from wikipedia</article-title>
          .
          <source>Semantic Web Journal</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Melnik</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garcia-Molina</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rahm</surname>
          </string-name>
          , E.:
          <article-title>Similarity flooding: A versatile graph matching algorithm and its application to schema matching</article-title>
          . In: Agrawal,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Dittrich</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          R. (eds.) ICDE. pp.
          <fpage>117</fpage>
          -
          <lpage>128</lpage>
          . IEEE Computer Society (
          <year>2002</year>
          ), http: //dblp.uni-trier.de/db/conf/icde/icde2002.html#MelnikGR02
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>