<!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>Result of Ontology Alignment with RiMOM at OAEI'06</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Yi Li, Juanzi Li, Duo Zhang, and Jie Tang Department of Computer Science and Technology, Tsinghua University</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this report, we briefly describe our system RiMOM and its underlying techniques. Given two ontologies, RiMOM intends to combine multiple strategies, aiming at finding the “optimal” alignments from the source ontology to the target one. RiMOM integrates multiple strategies: edit-distance based strategy, statistical-learning based strategy, and three similaritypropagation based strategies. Each strategy is defined based on one kind of ontological-information/approach. RiMOM conducts alignment finding as follows. It first estimates two factors respectively approximately representing the structure similarity and the label similarity of the two ontologies. The two factors are used in strategy selection to determine which strategies will be used in the alignment task. Then, we apply the selected strategies to find the alignment independently and combine the alignment results. Finally we employ the alignment refinement to prune “unbelievable” alignments. This report presents our results based on the evaluation. We also share our thoughts on the experiment design, showing specific strengths and weaknesses of our approach.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>PRESENTATION OF THE SYSTEM</title>
      <p>
        Ontology alignment is the key point to reach interoperability over ontologies. In
semantic web environment, ontologies are usually distributed and heterogeneous and
it is necessary to find the mapping between them before processing across them. In
recent years, much research work has been conducted for finding the alignment of
ontologies [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>
        RiMOM is a tool for ontology alignment by combining different strategies, aiming
at finding the “optimal” alignment results [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Each strategy is defined based on one
kind of information or one type of approach. In our current version, there are five
strategies defined: edit-distance based strategy, statistical-learning based strategy, and
three similarity-propagation based strategies (including concept-to-concept
propagation strategy (CCP), property-to-property propagation strategy (PPP), and
concept-to-property propagation strategy (CPP)).
1.1
      </p>
      <sec id="sec-1-1">
        <title>State, purpose, general statement</title>
        <p>We here define ontology alignment as a directional one. Given an alignment from
ontology O1 to O2, we call ontology O1 as source ontology and O2 as target ontology.
We call the process of finding the alignment from O1 to O2 as (Ontology) alignment
discovery or alignment finding.</p>
        <p>Challenges for automating ontology alignment include: 1) how to automatically
find alignments of high quality; 2) how to find the alignments efficiently; 3) how to
make full use of the user interaction, since entirely automatic alignment is usually not
possible; 4) how to automatically adjust the strategies for finding the alignments in a
specific task, since the characteristics of the ontologies to be aligned are different in
different tasks; 5) how to ease parameterizing, as the accuracy of alignments may
vary largely with different parameters.</p>
        <p>In this campaign, we focus on dealing with the problems of 1), 2), and 4) with our
system RiMOM.
1.2</p>
      </sec>
      <sec id="sec-1-2">
        <title>Specific techniques used</title>
        <p>There are six major steps in the alignment process of RiMOM:</p>
        <p>1) Similarity factors estimation. Given two ontologies, it estimates two similarity
factors, which respectively approximately represent the structure similarity and the
label similarity of the two ontologies. The two factors are used in the next step of
strategy selection.</p>
        <p>2) Strategy selection. The basic idea of strategy selection is if two ontologies have
high label similarity factor, then RiMOM will rely more on linguistic based strategies;
while if the two ontologies have high structure similarity factor, then we will employ
similarity-propagation based strategies on them. See Section 1.2.2 for details.</p>
        <p>3) Strategy execution. We employ the selected strategies to find the alignment
independently. Each strategy outputs an alignment result.</p>
        <p>4) Alignment combination. It combines the alignment results obtained by the
selected strategies. The combination is conducted by a linear-interpolation method.</p>
        <p>5) Similarity propagation. If the two ontologies have high structure similarity
factor, RiMOM employs an algorithm called similarity propagation to refine the
found alignments and to find new alignments that can not be found using the other
strategies. Similarity propagation makes use of structure information.</p>
        <p>6) Alignment refinement. It refines the alignment results from the previous steps.
We defined several heuristic rules to remove the “unbelievable” alignments.</p>
      </sec>
      <sec id="sec-1-3">
        <title>1.2.1 Multiple strategies</title>
        <p>The strategies defined in RiMOM can be classified into two categories: linguistic
based strategies and structure based strategies.</p>
      </sec>
      <sec id="sec-1-4">
        <title>1. Linguistic based strategies</title>
        <p>RiMOM contains two kinds of linguistic based strategies: edit-distance based
strategy and statistical-learning based strategy. In our current version of RiMOM, for
the statistical-learning based strategy, we use the classification method of K-Nearest
Neighbor (KNN). For facilitating the description, we hereafter write the two strategies
as ED and KNN.</p>
        <p>In ED, we calculate the edit distance between labels of two entities. In KNN, we
formalize the problem of alignment as a problem of text classification. We view
e2∈O2 as a class and its label, comment, and instances as a ‘document’ of the class.
The text in a ‘document’ is tokenized into words. Then we employ stemming and stop
words removing on the words and view the remains as features to train a text
classification model. We also add some other general features which prove to be very
helpful. For a concept, the features include: the number of its sub concepts, the
number of properties it has, and the depth of the concept from “OWL:Thing”.</p>
        <p>For finding the alignment, we use the same method to generate a ‘document’ for a
concept e1∈O1 and also add the general features as that in building the classification
model. Then we use the trained classification model to identify which class the
document should be classified. In this way, we are able to find which entity in O2 is
the most possible one for an entity e1∈O1 to be aligned.</p>
        <p>The two strategies can be used for finding alignments independently. They can also
be used together. In the latter case, we combine alignments of different strategies by:
Map (e1, e2 ) =
∑ k =1...n wkσ ( Mapk (e1, e2 ))
∑ k =1...n wk
(1)
σ ( x) = 1/ (1+ e−5(x−α ) ) , where α is tentatively set as 0.5.
where e1∈O1 and e2∈O2; Mapk(e1,e2) is the alignment score obtained by strategy k.
wk is the weight of strategy k. σ is a sigmoid function, which is defined as</p>
      </sec>
      <sec id="sec-1-5">
        <title>2. Structure based strategies</title>
        <p>
          The structure information in ontologies is useful for finding the alignments
especially when two ontologies share the common/similar structure. According to the
propagation theory [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], we define three structure based strategies in RiMOM, namely
concept-to-concept propagation strategy (CCP), property-to-property propagation
strategy (PPP), and concept-to-property propagation strategy (CPP).
        </p>
        <p>
          Intuition of the propagation based method is that if two entities are aligned, their
super-concepts may also be aligned. The basic idea of the method is to propagate the
similarity of two entities to entity pairs with some kinds of relationship with them, for
example, subClassOf, superClassOf, siblingClassOf, subPropertyOf, superPropertyOf,
range, and domain (superClassOf is not defined in OWL, it is viewed as the converse
relationship of subClassOf. Likewise for superPropertyOf. siblingClassOf is not
defined also in OWL. It means that the two concepts have the same super concept).
The idea is inspired by the algorithm of similarity flooding proposed for schema
matching [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. We extended the algorithm and adaptively used them in the three
structure based strategies. Details of the method will be reported elsewhere.
        </p>
        <p>In CCP, we propagate similarities of concepts pair across the concept hierarchical
structure. In PPP, we propagate similarities of property pair across the property
hierarchy. In CPP, we propagate similarities of concepts pair to their corresponding
property pair, and vice versa.</p>
        <p>The structure based strategies are employed after the linguistic based strategies.
They can be used to adjust the alignments and find new alignments.</p>
      </sec>
      <sec id="sec-1-6">
        <title>1.2.2 Similarity factors estimation</title>
        <p>Our preliminary experiments show that the multi-strategy based alignment does not
always outperform its single-strategy counterpart. We then consider three questions:
(1) for a new, unseen mapping task, should we select a multi-strategy based solution
or just one single-strategy based solution? (2) if the task is suitable to use multiple
strategies, then which strategies should be selected so as to obtain better alignment
results? (3) the method for strategy selection needs to be efficient. This is important
because for aligning large-scale ontologies, the efficiency may be a critical problem.
We propose to deal with the problems by using similarity factors estimation.</p>
        <p>Given two ontologies: source ontology O1 and target ontology O2, we calculate two
approximate similarity factors: structure similarity factor and label similarity factor.</p>
        <p>We define structure similarity factor as:
(2)
(3)
F _ SS =</p>
        <p>#common _ concept
max(# nonleaf _ c1, # nonleaf _ c2 )
where #nonleaf_c1 indicates the number of concepts in O1 that has sub concepts.
Likewise for #nonleaf_c2. #common_concept is calculated as follows: if concepts
c1∈O1 and c2∈O2 have the same number of sub concepts and they are in the same
depth from the concept “owl:Thing”, we add one to #common_concept. After
enumerated all pair, we obtain the final score of #common_concept. Intuition of the
factor is that the larger the structure similarity factor, the more similar the structures
of the two ontologies are.</p>
        <p>The label similarity factor is defined as:</p>
        <p>F _ LS =
# same _ label
max(#c1, #c2 )
where #c1 and #c2 respectively represent the number of concepts in O1 and O2.
#same_label represents the number of pairs of concepts {( c1, c2)|c1∈O1 and c2∈O2}
that have the same label.</p>
        <p>The two factors are defined simply and not used to accurately represent the real
“similarities” of structures and labels. However, they can approximately indicate the
characteristics of the two ontologies. Moreover, they can be calculated efficiently.</p>
        <p>So far, we carried out the strategy selection by heuristic rules. For example, if the
structure similarity factor F_SS is lower than 0.25, then RiMOM suppresses the CCP
and PPP strategies. However, the CPP will always be used in the alignment process.
1.3</p>
      </sec>
      <sec id="sec-1-7">
        <title>Adaptations made for the evaluation</title>
        <p>No special adaptations have been made. However, some parameters are tuned and set
in the experiments. For example, for strategies combination (cf. equation 1), we set
the weight of ED as 0.5 and that of KNN as 1. For strategy selection, we define 0.25
as the threshold to determine whether CCP and PPP will be suppressed or not. We
also define 0.2 as threshold to determine whether ED will be suppressed or not.
1.4</p>
      </sec>
      <sec id="sec-1-8">
        <title>Link to the system, parameters file, and provided alignments</title>
        <p>
          Our system RiMOM (including the parameters file) can be found at
http://keg.cs.tsinghua.edu.cn/project/RiMOM/. For details of the approach, see [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
        <p>The alignment results of the campaign are available at
http://keg.cs.tsinghua.edu.cn/project/RiMOM/OAEI2006/.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Results</title>
      <p>RiMOM has been implemented in Java. We use OWL-API to parse the RDF and
OWL files. The experiments were carried out on a Server running Windows 2003
with two Dual-Core Intel Xeon processors (2.8 GHz) and 3-gigabyte memory. All the
alignments outputted by RiMOM are based on the same parameters.
2.1</p>
      <sec id="sec-2-1">
        <title>Benchmark 2.1.1 Tests 101-104</title>
        <p>The tests 101, 103, and 104 are basic tests for ontology alignment. The source
ontologies contain concepts and properties with the same names as those in the
reference ontologies.</p>
        <p>Both linguistic based strategies and structure based strategies were employed for
finding the alignment (because both label similarity and structure similarity factors
exceed the thresholds), however, as linguistic based strategies can easily find most of
the alignments, the structure based strategies took little effect to the final results. In
test 102, RiMOM outputs no alignment.</p>
        <p>In the three tests (excluding test 102), both precision and recall are 1.0. The
average time cost is 3.36s.
2.1.2 Tests 201-210
Tests 201 through 210 have high structure similarity factor (equal to 1.0) with the
reference ontology. Some of the tests have high label similarity factor (e.g. test 203),
some have synonym labels with the reference ontology (e.g. test 205 and 209), and
some others have low label similarity factor (e.g. tests 201, 202, 206, 207, and 210).</p>
        <p>Using the strategies selection method, we are able to apply different strategies in
the different tests. For example, for test 201, where label of concepts and properties
are replaced by a random ones, ED is suppressed and KNN and the structure based
strategies are active. Using KNN, we can find some matched concept pairs and
property pairs. Then based on the matched pairs, we utilize the structure based
strategies to find the other alignments that cannot be found by KNN.</p>
        <p>In the ten tests, precision ranges from 0.88 to 1.0 and recall stays between 0.82 and
1.0. The average time cost is 2.638s.
2.1.3 Tests 221~247
For most of these tests the structures are changed, which means that the structure
similarity factors are low, however the label similarity factors are very high.</p>
        <p>For tests that have low structure similarity factors, we suppress the structured
based strategies, for example, tests 221, 232, 233, and 241. (Note: CPP is still active.)
For tests that have both high label similarity factor and structure similarity factor,
both linguistic based strategies and structure based strategies were employed,
although structure based strategies made little contribution.</p>
        <p>In these tests, precision ranges from 0.94 to 1.0 and recall equals to 1.0. The
average time cost is 1.99s.
2.1.4 Tests 248~266
These tests were the most challenging ones to our approach. Labels and comments
have been removed and structures have also been changed as well. In this case, both
label similarity factor and structure similarity factor between the source ontologies
and the reference ontology are low. For most of the tests, we found that KNN is the
most useful one and the other strategies take little effects. In tests 249, 250, and 257,
the structure based strategies took effect to help improve the final alignments.</p>
        <p>In these tests, precision ranges from 0.73 to 1.0 and recall stays between 0.27 and
0.82. The average time cost is 1.59s.
2.1.5 Tests 301~304
In tests 301-304, the source ontologies are from real world, modeled by different
institutions but for the same domain of bibliographic metadata. The real-world tests
combine the difficulties of the previous tests.</p>
        <p>In the tests, based on the strategy selection method, both linguistic based strategies
and structure based strategies were employed except the test 301, where we only
applied linguistic based strategies.</p>
        <p>In these tests, precision ranges from 0.77 to 0.9 and recall stays between 0.69 and
0.97. The average time cost is 3.14s.
2.2</p>
        <p>directory
The directory ontologies are organized as a taxonomy with sub-sumption hierarchies.
We use two methods to obtain the alignment results. The first one was obtained by
using RiMOM with the same set of parameters as the ones for benchmark test. Both
linguistic based strategies and structure based strategies were employed in this task.
The results seem to be not ideal.</p>
        <p>The other alignment result was obtained by a specific version of RiMOM, called
RiMOM-directory. In RiMOM-directory, except ED and KNN, we also integrate
another strategy based on Wordnet, one of the most popular thesauruses (called as
Wordnet hereafter). Because in directory alignment, there are many synonym words
used in the labels, Wordnet is expected to be useful. We also made some other
adaptation, for example, for structure based strategies we only use CCP, as there is no
property and instances in the directory data (also in CCP, we only consider the
relationship “OWL:subClassOf”).</p>
        <p>We obtained three alignment results using RiMOM-directory with different
strategies: 1) linguistic based strategies (including ED, KNN, and Wordnet) only. In
this case, the precision, recall, and F1-measure are 0.36, 0.33, and 0.35 respectively; 2)
both linguistic based strategies and the CCP strategy (with only one iteration of
propagation). The precision, recall, and F1-measure are 0.39, 0.40, and 0.40
respectively; 3) same setting as that in 2) but with n iterations. The precision, recall,
and F1-measure are 0.38, 0.40, and 0.39 respectively.
RiMOM met problems in parsing the anatomy ontologies and finally outputs no
alignments.</p>
        <p>The ontologies in the food test are large and RiMOM suppressed the structure based
strategies and applied only a simple version of the linguistic based strategies for
finding the alignment.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>General comments</title>
      <p>3.1</p>
      <sec id="sec-3-1">
        <title>Comments on the results</title>
        <p>An objective and comprehensive comment on strengths or weakness requires the
comparison with other participants, which are not available so far (will be available
before the workshop). Here, we share some thoughts about the results.</p>
      </sec>
      <sec id="sec-3-2">
        <title>Strengths</title>
        <p>From experimental results, we see that RiMOM can achieve high performance
when the ontologies to be aligned have similar linguistic information or similar
structure information. Some concluding remarks are summarized as follows:
1) Linguistic information (including label of concepts and properties) is important
and help to align most of the entities.</p>
        <p>2) Structure information can be used to improve the alignments, in particular when
linguistic information is missing.</p>
        <p>3) Strategy selection is important. In different alignment tasks, the ontologies to be
aligned have different characteristics, it would be particularly helpful to find the
characteristics of the ontologies and apply correspondingly strategies on them.</p>
        <p>4) Alignment refinement is helpful. In refinement, we removed the unbelievable
alignments, which improves the precision in many tests.</p>
        <p>5) RiMOM can find the alignment quickly. The time costs range from 0.69s to
6.70s in the benchmark tests.</p>
        <p>Weakness</p>
        <p>1) RiMOM cannot deal with large-scale ontologies. The biggest problem here is
that our structure base strategies cannot efficiently do the propagation in the large
graph (by viewing the ontology as a graph).</p>
        <p>2) We met problems when dealing with the anatomy ontologies.</p>
        <p>3) We note that parameter setting is very important. We have found that using
different parameter settings, with the exactly same approach, the alignment results
may differ largely. So far, we tuned the parameters manually. It is not adaptable in
particular when the ontologies are very large, which means that tuning different
parameters to find the best ones is not possible.
3.2</p>
      </sec>
      <sec id="sec-3-3">
        <title>Discussions on the way to improve the proposed system</title>
        <p>Possible improvements are corresponded to the related weaknesses in the previous
section.</p>
        <p>1) Our proposal is to partition the large ontologies into small slices and then
employ the structure based strategies on the slices.</p>
        <p>2) Efforts are being made to integrate a more powerful parser into our system.
3) Our thinking is to use a supervised machine learning method to find the optimal
parameters based on some training data sets.
3.3</p>
      </sec>
      <sec id="sec-3-4">
        <title>Comments on the OAEI 2006 test cases</title>
        <p>The benchmark tests indicate very interesting general results on how the alignment
approach behaves. These tests are really useful, as a good underlying test base, for
evaluating and improving the alignment algorithm and system.</p>
        <p>For future work, it might be interesting to add some tests to evaluate the time cost
of systems, as for large-scale ontology alignment, the issue of efficiency may be
critical.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>In this report, we have briefly introduced our approach and the tool, that is called
RiMOM, for finding ontology alignment. We have presented the alignment process of
RiMOM and explained each step. We applied the tool to the test data and the
experimental results show that our proposed approach can achieve high performance
quickly. We summarized the strengths and the weaknesses of our proposed approach
and gave possible improvement for the system in the future work.</p>
    </sec>
    <sec id="sec-5">
      <title>Appendix: Raw results</title>
      <p>The following results were obtained in the evaluation runs.
Matrix of results</p>
      <p>BibTeX/MIT
BibTeX/UMBC
Karlsruhe
INRIA</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          .
          <article-title>State of the art on ontology alignment</article-title>
          . http://www.inrialpes.fr/exmo/ cooperation/kweb/heterogeneity/deli/.
          <source>August</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>P. F.</given-names>
            <surname>Felzenszwalb</surname>
          </string-name>
          and
          <string-name>
            <given-names>D. P.</given-names>
            <surname>Huttenlocher</surname>
          </string-name>
          .
          <article-title>Efficient belief propagation for early vision</article-title>
          .
          <source>International Journal of Computer Vision</source>
          , Vol.
          <volume>70</volume>
          , No. 1,
          <year>October 2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Melnik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Garcia-Molina</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Rahm</surname>
          </string-name>
          <article-title>: Similarity Flooding: a versatile graph matching algorithm and its application to schema matching</article-title>
          .
          <source>In Proc. of 18th ICDE</source>
          . San Jose CA,
          <year>Feb 2002</year>
          . pp.
          <fpage>117</fpage>
          -
          <lpage>128</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>E.</given-names>
            <surname>Rahm</surname>
          </string-name>
          and
          <string-name>
            <given-names>P. A.</given-names>
            <surname>Bernstein</surname>
          </string-name>
          .
          <article-title>A survey of approaches to automatic schema matching</article-title>
          .
          <source>The VLDB Journal</source>
          ,
          <year>2001</year>
          ,
          <volume>10</volume>
          :
          <fpage>334</fpage>
          -
          <lpage>350</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Using Bayesian decision for ontology mapping</article-title>
          .
          <source>Journal of Web Semantics</source>
          . To be published.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>