<!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>FCAMap-KG Results for OAEI 2019</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Fei Chang</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Guowei Chen</string-name>
          <email>chenguowei17@mails.ucas.ac.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Songmao Zhang</string-name>
          <email>smzhang@math.ac.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute of Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences</institution>
          ,
          <addr-line>Beijing</addr-line>
          ,
          <country country="CN">P.R. China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>New York University</institution>
          ,
          <addr-line>New York</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Chinese Academy of Sciences</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <abstract>
        <p>In OAEI 2016, we submitted the system FCA-Map for taking advantage of the Formal Concept Analysis (FCA) formalism in aligning large and complex biomedical ontologies. This year, we present a variant called FCAMap-KG, following the rationale of FCA-Map and designed for matching knowledge graphs. Among the 12 matchers participating in the OAEI 2019 Knowledge Graph track, our system ranks the first for instance and property mappings and ranks second for class mappings. As a result, FCAMap-KG has achieved the best overall Fmeasure for the track. This demonstrates the power of our FCA-based approach in identifying correspondences across different kinds of data and knowledge representation systems.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>1.1</p>
    </sec>
    <sec id="sec-2">
      <title>State, purpose, general statement</title>
      <p>
        Formal Concept Analysis is a mathematical model for structuring concept hierarchies
from clustering individuals [
        <xref ref-type="bibr" rid="ref4 ref7">4,7</xref>
        ]. In FCA, the domain or problem is described first by
a formal context consisting of a set of objects, a set of attributes and their relations.
Based on this, a lattice structure can be computed with each node representing a formal
concept and edge a subconcept-superconcept relationship. Being a knowledge graph
matching system based on FCA, FCAMap-KG follows the rationale of our previous
systems FCA-Map and FCAMapX by consecutively constructing lexical and structural
formal contexts and extracting mappings across KGs.
      </p>
      <p>
        Ontologies and KGs are both knowledge representation models sharing RDF graphs
as the underlying data structure. Ontologies focus on schematic knowledge and adopt
logic-based reasoning to infer implied relations, whereas KGs mainly describe data in
RDF triples and train numerical vector representations so as to predict semantic
correlations [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Ontologies are limited to certain domains with precise knowledge and KGs
are much larger in scale where data can be noisy. For both, identifying correspondences
between systems is crucial for realizing semantic integration in the Semantic Web. Their
distinctive differences, however, make applying ontology matching approaches to KGs
a nontrivial endeavor. Particularly in our case, for building formal contexts at the
structural level, FCA-Map and FCAMapX mainly use the ontological relationships including
taxonomy, partonomy, disjointness, and property axioms among classes. While
normally these are not available in KGs, FCAMap-KG turns to RDF triples where two
instances are connected by a property. In our FCA-based approach, lexical formal
context describes how names share tokens from which lexical mappings are generated. This
is effective for both ontology and KG matching tasks as classes, properties and instances
are all labeled with preferred names and synonyms.
1.2
      </p>
    </sec>
    <sec id="sec-3">
      <title>Specific techniques used</title>
      <p>
        The steps that FCAMap-KG system implements are presented as follows.
1. Lexical matching. For the given two KGs in comparison, the system builds three
token-based formal contexts, for classes, properties and instances, respectively. One
entity in KG can have multiple names and labels, and every one of them is treated
as an object in the formal context; tokens extracted from all the names/labels in
two KGs are used as attributes. Note that one object in the formal context can be
associated with multiple entities in KGs and at the same time one entity can have
multiple entries as objects. In the Galois lattice constructed from token-based formal
context 4, lexical mappings are generated when formal concepts contain objects
originated from two KGs.
2. Structural matching. The system proceeds to construct the structural formal
context using lexical mappings obtained so far. KGs tend to have massive instances
while properties and classes are much less, and as stated in [
        <xref ref-type="bibr" rid="ref5 ref6">6,5</xref>
        ], matching instances
can be harder than classes and properties. Thus we focus on identifying structural
correspondence among instances at this step. For the given two KGs, every instance
is used as an object in the formal context. The attributes comes from pairing two
RDF triples across KGS whose properties and tail instances have been matched,
respectively, at the lexical step. Such a formal context describes how instances share
connections to other instances, thus has a potential to reflect the structural
similarities across KGs. In the lattice computed, structural mappings are generated when
formal concepts contain instances from two KGs.
3. Mapping filtering. The OAEI 2019 Knowledge Graph track bases its evaluation
on that all mappings are 1:1, i.e., one entity can only have at most one
correspondence in the other KG. Due to this, the system employs a filtering process on cases
      </p>
      <sec id="sec-3-1">
        <title>4 We implemented the algorithm Hermes [1] for constructing the lattice.</title>
        <p>when one entity occurs in multiple mappings identified. Mappings that possess more
shared structural attributes and more lexical tokens are selected.
1.3</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Adaptations made for the evaluation</title>
      <p>Conforming to the evaluation criteria of the Knowledge Graph track this year, the SEALS
submission of FCAMap-KG is modified to produce only 1:1 mappings. In general,
FCAMap-KG is not restricted this way and can find cases when one entity is matched
to multiple entities in another knowledge graph.
1.4</p>
    </sec>
    <sec id="sec-5">
      <title>Link to the system and parameters file</title>
      <p>The SEALS wrapped version of FCAMap-KG for OAEI 2019 is available at https:
//drive.google.com/open?id=1pZ5Hzv8_wfULKYN4Uc_kcmlkPseJ7kQ_
1.5</p>
    </sec>
    <sec id="sec-6">
      <title>Link to the set of provided alignments</title>
      <p>The results obtained by FCAMap-KG for OAEI 2019 are available at https://drive.
google.com/open?id=1bS19DDe7nZNC1MlHB8qX-yoACWBWELGR
2</p>
      <sec id="sec-6-1">
        <title>Results</title>
        <p>In this section, we present the evaluation results obtained by running FCAMap-KG on
Knowledge Graph track under the SEALS client in OAEI 2019 campaign. Although
our system was not intended to participate in other tracks, OAEI reported whenever
FCAMap-KG could generated an alignment 5. Therefore, the results for these tracks
will also be introduced including Anatomy, Large Biomedical Ontologies, Disease and
Phenotype, and Biodiversity and Ecology. The evaluation was performed on a virtual
machine (VM) with 32GB of RAM and 16 vCPUs (2.4 GHz).
2.1</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>The OAEI 2019 Knowledge Graph Track</title>
      <p>The Knowledge Graph track requires finding alignments at both schema and data level,
including class mappings, property mappings and instance mappings. The track consists
of a total of five matching tasks among nine isolated knowledge graphs for describing
movies, comics, TV and books. We follow the OAEI evaluation criteria in counting
positives and negatives based on 1:1 matching and the partialness of gold standard. The
overview results of FCAMap-KG are presented in Table 1 where Size indicates an
average number of mappings obtained. As reported by OAEI 6, among the 12 participants,
our system ranks the first in F-measure for instance and property mappings and ranks
second for class mappings. As a result, FCAMap-KG has achieved the best overall
Fmeasure for the track.</p>
      <sec id="sec-7-1">
        <title>5 http://oaei.ontologymatching.org/2019/results/</title>
        <p>6 http://oaei.ontologymatching.org/2019/results/knowledgegraph/index.html</p>
        <p>Size Prec. Rec. F-m.</p>
        <p>Size Prec. Rec. F-m.
18.6 1.00 0.70 0.82 69.0 1.00 0.96 0.98 4530.6 0.90 0.79 0.84 4792.6 0.91 0.79 0.85</p>
        <p>The overall performance of FCAMap-KG for each matching task is listed in Table 2,
and when breaking down into class, property and instance mappings, the results for each
task are shown by Table 3, Table 4, and Table 5, respectively. FCAMap-KG stands out
in matching properties by having a 100% precision for four tasks, and according to
OAEI, obtains the best F-measure for all five tasks among 12 participants. For instance
mappings, the system stays in top three F-measures for all tasks; all the class mappings
generated by FCAMap-KG for the track are correct and its F-measure ranks first for two
tasks.
OAEI reported the performance of our system in tracks other than the Knowledge Graph,
and they are Anatomy, Large Biomedical Ontologies, Disease and Phenotype, and
Biodiversity and Ecology. The results obtained by FCAMap-KG for these tracks are shown
in Table 6, 7, 8, and 9, respectively.</p>
        <p>– The Anatomy track aims at finding an alignment between the Adult Mouse Anatomy
(2744 classes) and a fragment of the NCI Thesaurus (3304 classes) for describing
the human anatomy.
– The Large Biomedical Ontologies track consists of identifying mappings among the
Foundational Model of Anatomy (FMA), SNOMED CT, and the National Cancer
Institute Thesaurus (NCI). These ontologies are of both large-scale and semantic
richness, and both whole ontologies and fragments are used.
– The Disease and Phenotype track involves the matching task between the Human
Phenotype (HP) Ontology and the Mammalian Phenotype (MP) Ontology, and the
matching between Human Disease Ontology (DOID) and the Orphanet and Rare
Diseases Ontology (ORDO).
– The Biodiversity and Ecology track aims at detecting equivalence between the
Environment Ontology (ENVO) and the Semantic Web for Earth and Environment
Technology Ontology (SWEET), and between the Plant Trait Ontology (PTO) and
the Flora Phenotype Ontology (FLOPO).</p>
        <p>Note that unlike FCAMap and FCAMapX specifically for aligning biomedical
ontologies, FCAMap-KG targets knowledge graphs where schematic knowledge is
generally rare, thus none domain thesauri or external terminologies have been used to
facilitate the matching. It is understandable that FCAMap-KG did not perform as well
as FCAMap and FCAMapX on life sciences ontologies. Nevertheless, without the
support of any domain knowledge, FCAMap-KG ranks first in precision for MA-NCI task
among 12 participants, for the two Disease and Phenotype tasks among 8 participants,
and for ENVO-SWEET task among 6 participants.
3
3.1</p>
        <sec id="sec-7-1-1">
          <title>General comments</title>
        </sec>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>Comments on the results</title>
      <p>This is the third time that we participate in the OAEI campaign with our Formal Concept
Analysis based system. Developed targeting knowledge graph matching, FCAMap-KG
has achieved a satisfactory result by ranking first in F-measure for overall five KG tasks
among 12 participants. For every single task, our system obtains the best F-measure
for property mappings and remains in top three for instance mappings. Of note,
taking advantage of the efficiency mechanism implemented by FCAMapX, FCAMap-KG
managed to finish all the KG tasks within given time despite the high computation
complexity of FCA formalism per se. Additionally, although unintended, FCAMap-KG is
reported in four biomedicine and ecology tracks by OAEI 2019 with a competitive
performance in precision.
3.2</p>
    </sec>
    <sec id="sec-9">
      <title>Discussions on possible improvements</title>
      <p>The very first step of FCAMap-KG is lexical matching whose resultant mappings are
used in the subsequent structural matching steps. This means that our system is
susceptible to the lexical labeling of entities in knowledge graphs. When the naming is
diverse across KGs, as in the case of marvelcinematicuniverse - marvel, gold
standard mappings like &lt; marvelcinematicuniverse : Combat_Enhancers; marvel :
Adrenaline_P ills &gt; can be missed. For this task, FCAMap-KG’s F-measure is 10%
to 20% lower than the other four tasks, as listed in Table 2. This indicates the
importance of structural matching which is capable of identifying matches not having anything
common in names. We are in the process of constructing an iterative framework for
using mappings obtained so far to enhance the current loop of matching until no further
mappings are found. Such a comprehensive way of incorporating lexical and structural
information of classes, properties and instances can take advantage of data and
knowledge represented in KGs to the fullest.</p>
      <p>As mentioned above, an adjustment made in FCAMap-KG for participating the
Knowledge Graph track is to limit the mappings selected to one-to-one. Again, take
the task marvelcinematicuniverse - marvel for example, where two mappings
&lt; marvelcinematicuniverse : Zodiac; marvel : Zodiac &gt; and
&lt; marvelcinematicuniverse : Zodiac; marvel : Zodiac_V irus &gt; are generated
by our system and eventually the former is selected whereas the latter is the correct
match in gold standard. None whatsoever relevant structural information within the two
KGs makes it difficult to do the right decision. For such cases, external resources shall
be exploited, providing necessary knowledge for the domain of interest.
With respect to the OAEI procedure, the Knowledge Graph track that our system
participated in this year is adequately well designed, with organizers being very supportive in
resolving issues arisen in the middle of execution phase. The only difficulty we
encountered comes from a dependency on Jena packages on the SEALS platform. The problem
got settled successfully in the end, and it might be helpful if participants whose systems
include Jena packages can be informed in advance that re-packaging Jena on SEALS
platform requires additional declaration of the Global Location Mapper. Overall, we
sincerely appreciate the efforts by organizers in establishing the OAEI campaign, and
with the prospect of further improving the system, we look forward to be back next year.
4</p>
      <sec id="sec-9-1">
        <title>Conclusions</title>
        <p>In this paper, we present a variant of FCA-Map called FCAMap-KG, which is
particularly designed for matching knowledge graphs. KGs are normally of large size and
focus on describing instance connected with properties rather than schematic
knowledge of classes as in domain ontologies. FCAMap-KG’s performance in the OAEI 2019
Knowledge Graph track, together with its two predecessors, demonstrates the power of
our FCA-based approach in detecting correspondences across different kinds of data
and knowledge representation systems. With the prevail of knowledge graph research
in Semantic Web and knowledge engineering community and in industry, extending
our system with comprehensive functions and frameworks shall contribute more to this
thriving domain.
Matching Task Size Precision Recall F-measure
FLOPO-PTO 171 0.836 0.601 0.699</p>
        <p>ENVO-SWEET 422 0.803 0.518 0.630</p>
      </sec>
      <sec id="sec-9-2">
        <title>Acknowledgements</title>
        <p>This work was done when the first author was an intern at the Academy of
Mathematics and Systems Science, Chinese Academy of Sciences. The work has been
supported by the National Key Research and Development Program of China under grant
2016YFB1000902 and the Natural Science Foundation of China grant 61621003.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Berry</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gutierrez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huchard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Napoli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sigayret</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation</article-title>
          .
          <source>Annals of Mathematics and Artificial Intelligence</source>
          <volume>72</volume>
          (
          <issue>1-2</issue>
          ),
          <fpage>45</fpage>
          -
          <lpage>71</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bordes</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Usunier</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garcia-Duran</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weston</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yakhnenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Translating embeddings for modeling multi-relational data</article-title>
          .
          <source>In: Advances in neural information processing systems</source>
          . pp.
          <fpage>2787</fpage>
          -
          <lpage>2795</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          , Zhang,
          <string-name>
            <surname>S.:</surname>
          </string-name>
          <article-title>FCAMapX results for OAEI 2018</article-title>
          . In: OM@ ISWC. pp.
          <fpage>160</fpage>
          -
          <lpage>166</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Ganter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wille</surname>
          </string-name>
          , R.:
          <source>Formal concept analysis: mathematical foundations</source>
          . Springer Science &amp; Business
          <string-name>
            <surname>Media</surname>
          </string-name>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Hertling</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paulheim</surname>
          </string-name>
          , H.:
          <article-title>DBkWik: A Consolidated Knowledge Graph from Thousands of Wikis</article-title>
          .
          <source>In: 2018 IEEE International Conference on Big Knowledge (ICBK)</source>
          . pp.
          <fpage>17</fpage>
          -
          <lpage>24</lpage>
          . IEEE (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Hofmann</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perchani</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Portisch</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hertling</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paulheim</surname>
          </string-name>
          , H.:
          <article-title>DBkWik: Towards Knowledge Graph Creation from Thousands of Wikis</article-title>
          . In: International Semantic Web Conference (Posters, Demos &amp; Industry Tracks) (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Wille</surname>
          </string-name>
          , R.:
          <article-title>Restructuring lattice theory: an approach based on hierarchies of concepts</article-title>
          .
          <source>In: International Conference on Formal Concept Analysis</source>
          . pp.
          <fpage>314</fpage>
          -
          <lpage>339</lpage>
          . Springer (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , S.:
          <article-title>FCA-Map results for OAEI 2016</article-title>
          . In: OM@ ISWC. pp.
          <fpage>172</fpage>
          -
          <lpage>177</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , S.:
          <article-title>Identifying and validating ontology mappings by formal concept analysis</article-title>
          .
          <source>In: OM@ ISWC</source>
          . pp.
          <fpage>61</fpage>
          -
          <lpage>72</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
          </string-name>
          , G.:
          <article-title>Matching biomedical ontologies based on formal concept analysis</article-title>
          .
          <source>Journal of biomedical semantics 9</source>
          (
          <issue>1</issue>
          ),
          <volume>11</volume>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>