<!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>An Ontology Mapping Method Based on Support Vector Machine</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jie Liu</string-name>
          <email>liujxxxy@126.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Linlin Qin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hanshi Wang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>College of Information and Engineering, Capital Normal University</institution>
          ,
          <addr-line>Beijing 100048</addr-line>
          ,
          <country country="CN">P.R.China</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Ontology mapping has been applied widely in the field of semantic web. In this paper a new algorithm of ontology mapping were achieved. First, the new algorithms of calculating four individual similarities (concept name, property, instance and structure) between two concepts were mentioned. Secondly, the similarity vectors consisting of four weighted individual similarities were built, and the weights are the linear function of harmony and reliability, and the linear function can measure the importance of individual similarities. Here, each of ontology concept pairs was represented by a similarity vector. Lastly, Support Vector Machine (SVM) was used to accomplish mapping discovery by training the similarity vectors. Experimental results showed that, in our method, precision, recall and f-measure of ontology mapping discovery reached 95%, 93.5% and 94.24%, respectively. Our method outperformed other existing methods.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Introduction: In this paper, our study mainly is to discover the mapping[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] between
concepts belonging to the different ontologies respectively. The proposed algorithm
about ontology mapping in this paper mainly focuses on the following two points:
1. Using new methods of calculating individual similarities (concept name, property,
instance and structure).
2. Proposing the methods of similarity aggregation using SVM to classify the
similarity vectors which reflect the similarities of concept pairs. Here, the elements of a
similarity vector consist of the weighted individual similarities, and the weight of an
individual similarity is the linear function of harmony[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and reliability[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>To evaluate the method proposed in this paper, we used the benchmark tests in
OAEI ontology matching campaign 2012 as data sets, and got precision, recall and
fmeasure of the different ontology mapping algorithms by experiment.
The algorithms of ontology mapping: The process from calculating similarities to
discovering ontology mapping is shown as Fig.1. In Fig.1, O1, O2 are two ontologies.
Firstly, four individual similarities were computed; secondly, the similarity vectors
consisting of four weighted individual similarities were built, and the weights were
decided by both of harmony and reliability. Here, each of concept pairs between two
ontologies was represented by a similarity vector; lastly, SVM was used to
accomplish mapping discovery by classifying the similarity vectors.</p>
      <p>O1 O2
Class name similarity Property similarity Instance similarity
Cbalassesdrnoeanlmiahebaisrliimmtyoinlayri&amp;ty bParsoepdreeorltniyahbsaiimlrimtiyloanriyty&amp; bIanssetadrneoclneiahbsaiimlrimtiyloanriyt&amp;y</p>
      <p>Similarity vectors</p>
      <p>Structure similarity
Structure similarity
based on harmony&amp;</p>
      <p>reliability
Mapping discovery based on SVM</p>
      <p>O1 O2</p>
      <p>Fig.1. Process of ontology mapping
Experiment Design: Ontology mapping methods related to similarity calculation
have been discussed in many studies, and precision, recall and f-measure are usually
used to evaluate mapping results. Experimental steps are as follows:</p>
      <p>(1) For all ontological concept pairs, the four individual similarities would be
calculated; (2)These similarities would be aggregated and mappings between ontologies
would be extracted by using 11 methods such as “Neural network”, “Sigmoid”,
“Harmony”, “Reliability” and so on;(3) For our approach, after four individual similarities and
their respective harmony and reliability were worked out, similarity vectors consisting
of our weighted individual similarities would be built, and the weights are the linear
function of harmony and reliability, and ontology mappings would be extracted by
SVM;(4)For all ontology pairs, precision, recall and f-measure of ontology mapping
discovery would be calculated in every methods.</p>
      <p>Result: Precision, recall and f-measure in our approach reach 0.95,0.935 and 0.9424,
respectively, and are the highest, which can validate that the results of mapping
discovery are more accurate after harmony and reliability is joined into SVM, and also
can show that our approach outperforms than others dramatically.</p>
      <p>Conclusions: This study is an effective approach to resolve the problem about
ontology mapping in the Semantic Web. Future work will focus on studying the mapping
algorithms between uncertain ontologies.</p>
      <p>ACKNOWLEDGMENTS
This paper is supported by the National Nature Science Foundation (No.61371194,
61303105).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>P.</given-names>
            <surname>Shvaiko</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          . Ontology Matching:
          <article-title>State of the Art and Future Challenges. Knowledge and Data Engineering</article-title>
          , IEEE Transactions on,
          <year>2013</year>
          ,
          <volume>25</volume>
          (
          <issue>1</issue>
          ):
          <fpage>158</fpage>
          -
          <lpage>176</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Ming</given-names>
            <surname>Mao</surname>
          </string-name>
          , Yefei Peng, and
          <string-name>
            <given-names>Michael</given-names>
            <surname>Spring</surname>
          </string-name>
          .
          <article-title>An Adaptive Ontology Mapping Approach with Neural Network based Constraint Satisfaction</article-title>
          ,
          <source>Journal of Web Semantics</source>
          , Volume
          <volume>8</volume>
          , Issue 1 (
          <year>2010</year>
          ), page
          <fpage>14</fpage>
          -
          <lpage>25</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Mahboobeh</given-names>
            <surname>Houshmand</surname>
          </string-name>
          , Mahmoud Naghibzadeh,
          <string-name>
            <given-names>Saeed</given-names>
            <surname>Araban</surname>
          </string-name>
          .
          <article-title>Reliability-based Similarity Aggregation in Ontology Matching[C]</article-title>
          .
          <source>2010 IEEE International Conference on Intelligent Computing and Intelligent Systems</source>
          , Xiamen, China: IEEE,
          <year>2010</year>
          :
          <fpage>744</fpage>
          -
          <lpage>749</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>