<!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>AROMA results for OAEI 2008</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Je´roˆme David</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>INRIA Rhoˆne-Alpes</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Montbonnot Saint-Martin</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>France Jerome.David-at-inrialpes.fr</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>This paper presents the results obtained by AROMA for its first participation to OAEI. AROMA is an hybrid, extensional and asymmetric ontology alignment method which makes use of the association paradigm and a statistical interstingness measure, the implication intensity.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>1.1</p>
    </sec>
    <sec id="sec-2">
      <title>Presentation of AROMA</title>
      <sec id="sec-2-1">
        <title>State, purpose, general statement</title>
        <p>AROMA is an hybrid, extensional and asymmetric matching approach designed to find
out relations (equivalence and subsumption) between entities issued from two textual
taxonomies (web directories or OWL ontologies). Our approach makes use of the
association rule paradigm [Agrawal et al., 1993], and a statistical interestingness measure
used in this context. AROMA relies on the following assumption: An entity A will be
more specific than or equivalent to an entity B if the vocabulary (i.e. terms and also
data) used to describe A, its descendants, and its instances tends to be included in that
of B.
1.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Specific techniques used</title>
        <p>AROMA is divided into three successive main stages: (1) The pre processing stage
allows to represent each entity (classes and properties) by a set of terms, (2) the second
stage consists of the discovery of association rules between entities, and finally (3) the
post processing stage aims to clean and enhance the alignment.</p>
        <p>The first stage constructs a set of relevant terms and/or datavalues for each entity.
To do this, we extract the vocabulary of entities from their annotations and individual
values with the help of single and binary term extractor applied to stemmed text.</p>
        <p>The second stage of AROMA discovers the subsumption relations by using the
association rule model and the implication intensity measure [Gras et al., 2008]. In the
context of AROMA, an association rule a ! b represents a quasi-implication (i.e. an
implication allowing some counter-examples) from the vocabulary of entity a into the
vocabulary of the entity b. Such a rule could be interpreted as a subsumption relation
from the antecedent entity toward the consequent one. For example, the binary rule
car ! vehicle could be interpret: ”The concept car is more specific than the concept
vehicle”. The rule extraction algorithm takes advantage of the partial order structure
provided by the subsumption relation, and a property of the implication intensity for
pruning the search space.</p>
        <p>The last stage concerns the post processing of the association rule set. It performs
the following tasks:
– the deduction of equivalence relations,
– the suppression of cycles in the alignment graph,
– the suppression of the redundant correspondences,
– the selection of the best correspondence for each entity (the alignment is an
injective function),
– the enhancement of the alignment by using a string similarity -based matcher
(JaroWinkler similarity) and previously discovered correspondences.</p>
        <p>For more details, the reader should refer to [David et al., 2007; David, 2007].
1.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Link to the system and parameters file</title>
        <p>The version of AROMA used for OAEI 2008 is available at:
http://www.inrialpes.fr/exmo/people/jdavid/oaei2008/AROMA_oaei2008.jar.</p>
        <p>The source code is available at :
http://www.inrialpes.fr/exmo/people/jdavid/oaei2008/AROMAsrc_oaei2008.jar</p>
        <p>For align two ontologies use the following command line:
java -jar AROMA_oaei2008.jar onto1.owl onto2.owl</p>
        <p>The resulting alignment is provided on the standard output in the alignment format.
1.4</p>
      </sec>
      <sec id="sec-2-4">
        <title>Link to the set of provided alignments (in align format)</title>
        <p>http://www.inrialpes.fr/exmo/people/jdavid/oaei2008/results_AROMA_oaei2008.zip
2</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Results</title>
      <p>We participated to benchmark, anatomy and fao tests. We used the same configuration
of AROMA for all tests. We did not have scaling problems. We only comment
benchmark results because we do not have the results on the other tests. We also discuss why
we did not participate to directory and mldirectory tests.
2.1</p>
      <p>benchmark
Since AROMA only relies on textual information, it obtains bad recall values when the
alterations affect all text annotations both in the class/property descriptions and in their
individual/property values. AROMA seems do be not influenced by structural
alterations ( 222-247). On these tests, AROMA favors high precision values in comparison
to recall values.
2.2</p>
      <p>anatomy
On anatomy test, we do not use any particular knowledge about biomedical domain.
Anatomy ontologies use their own annotation properties. We have made some
adaptations in order to deal with these annotations.</p>
      <p>In terms of precision and recall, AROMA performs worse than the label equality
matcher. In particular, it obtains quite low recall value. Nevertheless, it discovers 30%
of non-trivial correspondences that are not found by the term equality matcher.</p>
      <p>Since AROMA takes benefits of the subsumption relation for pruning the search
space, it runs quite fast. This pruning feature partially explains the low recall value
obtained by AROMA on the anatomy test.
2.3 fao
2.4</p>
      <p>directory
We do not make any adaptation for this test. Fao ontologies (as anatomy) use their own,
as a consequence, some textual data were not taken into account by AROMA.</p>
      <p>On this test, AROMA also obtains low recall value and some results have not been
evaluated due to the lack of returned correspondences.</p>
      <p>The two large directories (given previous years but not this year) are divided into very
small sub directories. AROMA cannot align such very small directories because our
method is based on a statistical measure and then it needs some large amount of textual
data. However, AROMA discovers correspondences when it is applied to the complete
directories. It would be interesting to reintroduce these large taxonomies for the next
editions.
2.5</p>
      <p>mldirectory
AROMA only relies on common textual data shared by ontologies to be align and it
does not use multi-lingual resources. As a consequence, it does not work with this kind
of tests.
3</p>
    </sec>
    <sec id="sec-4">
      <title>General comments on AROMA</title>
      <p>Even if results are quite good on benchmark track, alignments provided by AROMA
have quite low recall values. This is partially due to the pruning strategy used. To
overcome this drawback, we used a syntactical matcher in order to augment alignments.
Even if it performs well on benchmarks ontologies, this matcher seems not to be very
efficient on real cases (fao and anatomy).</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>For its first participation to OAEI, AROMA passed the benchmark, FAO and Anatomy
tests. We do not have any scaling problem with these tests.</p>
      <p>The results on benchmarks shows that AROMA is dependent on the amount of
textual information available and it has bad results when both labels and comments
are suppressed. However, AROMA is not very influenced by structural alterations. On
anatomy track, AROMA has good runtimes but lacks in terms of recall. FAO track
corroborates this drawback.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [Agrawal et al.,
          <year>1993</year>
          ]
          <string-name>
            <given-names>Rakesh</given-names>
            <surname>Agrawal</surname>
          </string-name>
          , Tomasz Imielinski, and
          <string-name>
            <given-names>Arun</given-names>
            <surname>Swami</surname>
          </string-name>
          .
          <article-title>Mining association rules between sets of items in large databases</article-title>
          .
          <source>In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data</source>
          , pages
          <fpage>207</fpage>
          -
          <lpage>216</lpage>
          . ACM Press,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [David et al.,
          <year>2007</year>
          ] Je´roˆme David,
          <string-name>
            <given-names>Fabrice</given-names>
            <surname>Guillet</surname>
          </string-name>
          , and Henri Briand.
          <article-title>Association rule ontology matching approach</article-title>
          .
          <source>International Journal on Semantic Web and Information Systems</source>
          ,
          <volume>3</volume>
          (
          <issue>2</issue>
          ):
          <fpage>27</fpage>
          -
          <lpage>49</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [David, 2007]
          <article-title>Je´roˆme David</article-title>
          .
          <article-title>AROMA : une me´thode pour la de´couverte d'alignements oriente´s entre ontologies a` partir de re`gles d'association</article-title>
          .
          <source>PhD thesis</source>
          , Universite´ de Nantes,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [Gras et al.,
          <year>2008</year>
          ] Re´gis Gras, Einoshin Suzuki, Fabrice Guillet, and Filippo Spagnolo, editors.
          <source>Statistical Implicative Analysis, Theory and Applications</source>
          , volume
          <volume>127</volume>
          <source>of Studies in Computational Intelligence</source>
          . Springer,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>