<!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>Discovering Cross-Ontology Subsumption Relationships by Using Ontological Annotations on Biomedical Literature</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Watson W.K. Chua</string-name>
          <email>watsonchua@pmail.ntu.edu.sg</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>¤and Jung-jae Kim</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>02a-32, Nanyang Avenue Singapore 639798</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Nanyang Technological University School of Computer Engineering Block N4</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Cross-ontology concept subsumption relationships facilitate the integration of ontologies by explicitly defining the generalization of a concept over other concepts in different ontologies. However, existing methods for discovering these relationships show poor performances and one of the problems is the lack of instance data in ontologies that can be used to identify cross-ontology subsumptions reliably. To address the problem, we present a novel method, SURD (SUbsumption Relation Discovery), which uses annotations on biomedical text corpora for populating ontologies with instances. Subsumption relationships between pairs of concepts are then determined based on their shared instances. SURD shows good performance when applied to biomedical ontologies, achieving precision values of 0:786 and 0:729 for cross-ontology subsumptions between the ontology pairs GRO-UMLS Metathesaurus and GENIAUMLS Metathesaurus respectively. As a practical application, we used SURD's subsumptions for automated ontological corpus annotation and achieved F-measures of 0:693 and 0:783 on the GRO and GENIA corpora respectively. These results are superior to the results of using subsumption relations inferred from equivalence relations (F-measures of 0:569 and 0:645) and subsumption relations identified with Hearst patterns (F-measures of 0:002 and 0:096).</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 INTRODUCTION</title>
      <p>
        Ontologies are continually being developed to model sub-domains
of the biomedical sciences. While the proliferation of ontologies
brings about greater expressivity in knowledge representation, it
also creates a new problem in knowledge sharing. Applications
using different ontologies face inter-operability issues when
relationships (e.g. equivalence, subsumption) between concepts
in different ontologies are not explicitly stated. The process of
discovering relationships between concepts in different ontologies
is known as Ontology Alignment
        <xref ref-type="bibr" rid="ref7">(Euzenat and Shvaiko, 2007)</xref>
        and
extensive research has been performed in this area. However, the
majority of existing Ontology Alignment research focuses solely
on the discovery of equivalence relationships between concepts in
different ontologies. Equivalence relationships alone are insufficient
to fully support inter-operability, especially in the Biomedical
Science domain where ontologies are often orthogonal
        <xref ref-type="bibr" rid="ref8">(Ghazvinian
et al., 2010)</xref>
        and few concepts from different ontologies are
semantically equivalent. Subsumption relationships complement the
equivalence relationships by explicitly stating the generalization of
should
addressed:
a concept over other concepts. In this paper, our objective is to
find subsumption relationships directly, without inferring them from
equivalence relationships.
      </p>
      <p>For example, consider the integration of two populated
ontologies, O1 and O2, and a query of listing all instances of Ci
in the integrated ontology where Ci is originally a concept in O1.
The answers of the query consist of the instances of Ci and its
descendants in O1, as well as the instances of O2 concepts which
are semantic equivalences and descendants of Ci. We can find some
of the O2 instances by using equivalence relations between O1 and
O2 concepts. For example, if there is an ancestor concept of Cj ,
Cja, which is equivalent to Ci or one of its descendant concepts,
Cid, we can infer through description logics that Cj v Ci:</p>
      <p>Cj v Cja ´ Cid v Ci
However, it is not always possible to find equivalent concepts Cid
and Cja that act as bridges for inferring meaningful subsumption
relations. For example, if two ontologies are orthogonal, it is
most likely that only a few top-level concepts (e.g. Thing) are
shared by the two ontologies, and the subsumption relations of such
generic concepts are not very useful for knowledge sharing. We will
show that there are many subsumption relations between biomedical
ontologies that cannot be deduced from equivalence relations and
that they are highly useful for inter-operability between ontologies.</p>
      <p>
        We propose an instance-based technique, SURD (short
for SUbsumption Relations Discovery) to find cross-ontology
subsumption relations directly. This technique determines whether
a subsumption relationship exists between a pair of concepts based
on the common instances they share. However, many existing
ontologies are schema ontologies with no instances
        <xref ref-type="bibr" rid="ref6">(Ehrig et al.,
2005)</xref>
        . We resolve this issue using a novel technique that uses
ontological annotations on biomedical literature as instances. Apart
from ontology integration, subsumption relations can also be used
for (semi-) automatic ontology annotation. This is most useful in
the biomedical domain in which comprehensive lexical resources
like UMLS exist. We further elaborate this application in Section 5.
      </p>
      <p>The outline of the paper is as follows: Related work is presented
in Section 2. Section 3 describes the SURD technique that finds
subsumption relations between different ontologies while in Section
4, we describe the experiments we carried out and present the
results. We show applications of our technique in Section 5, before
finally concluding the paper in Section 6.
to determine if a subsumption relationship exists between them. We
give an outline of SURD in Figure 1.</p>
      <p>used in populating</p>
      <p>Ontology</p>
      <p>Oi
Annotator</p>
      <p>Ai
Text
Corpus,</p>
      <p>P
Annotator</p>
      <p>Aj
produces
produces
uses
Ontology
annotated
Corpus,</p>
      <p>Pi
Ontology
annotated
Corpus,</p>
      <p>Pj
uses
2</p>
    </sec>
    <sec id="sec-2">
      <title>RELATED WORK</title>
      <p>
        The discovery of relationships between concepts in different
ontologies has been extensively researched and previous works
have been surveyed in
        <xref ref-type="bibr" rid="ref7">(Euzenat and Shvaiko, 2007)</xref>
        and
        <xref ref-type="bibr" rid="ref3">(Chua
and Goh, 2010)</xref>
        . Techniques like ASMOV
        <xref ref-type="bibr" rid="ref10">(Jean-Mary et al.,
2009)</xref>
        use logical inference on equivalence relationships to find
subsumption relationships as explained in the Introduction. The
subsumption relations found using these techniques have poor
coverage as there are many cases where subsumption relationships
can exist without equivalence relationships. We address this issue
by proposing an instance-based approach.
        <xref ref-type="bibr" rid="ref17">van Hage et al., 2005</xref>
        make use of text corpora for finding subsumption relations by
using Hearst patterns
        <xref ref-type="bibr" rid="ref9">(Hearst, 1992)</xref>
        . While Hearst patterns
work well in the general domain, their effectiveness is limited
when the domain is restricted to a specialized domain like the
biomedical domain where authors can safely assume that readers
have sufficient background knowledge. Therefore, the type of an
entity is seldom explicitly specified using such Hearst patterns as
“Ci such as/including/especially Cj ” where Ci and Cj are concepts
from different ontologies. We tested the Hearst patterns on 1200
biomedical documents and could find less than 20 subsumption
relations between concepts from ontologies of our interest (see
Section 5 for details). In contrast, SURD shows much better
coverage for biomedical ontologies.
      </p>
      <p>
        Instance-based methods
        <xref ref-type="bibr" rid="ref15 ref5">(Doan et al., 2004; Kirsten et al.,
2007)</xref>
        have been used for finding equivalence relationships between
ontologies. However, these techniques cannot be widely applied
due to the difficulties in finding common sets of instances shared
by ontology-pairs. By using different ontological annotations on
the same set of biomedical documents, we are able to alleviate
the problem and allow instance-based techniques to be applied for
finding both equivalence and subsumption relationships.
      </p>
      <p>
        <xref ref-type="bibr" rid="ref16">Spiliopoulos et al., 2010</xref>
        use machine learning to find
subsumption relations in the absence of instances. A model is
trained using intra-ontology subsumption relations in a pair of
ontologies before applying the trained model to concept-pairs in the
two ontologies to find cross-ontology subsumption relations. The
approach, known as Classification-Based Learning of Subsumption
Relations (CSR), is effective if both ontologies have similar
hierarchical structures. However, the biomedical ontologies we
analyze in this paper have quite different structures: For example,
the UMLS Metathesaurus’ hierarchical structure is rather flat,
considering its size, but GRO has a relatively deep hierarchical
structure. The SURD approach does not face this problem since it
is able to populate the ontologies with instances and is not heavily
dependent on the structures of ontologies.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>METHODOLOGY</title>
      <p>Given a pair of ontologies Oi and Oj , we want to find all triplets
&lt; Ci; R; Cj &gt; where Ci 2 Oi, Cj 2 Oj and R 2 f´
; @; A; ?g. Ci ´ Cj means that Ci and Cj are equivalent
concepts. Ci @ Cj indicates that Ci is a sub concept of Cj ,
while Ci A Cj means the inverse subsumption relation. Ci ? Cj
means Ci and Cj have no subsumption or equivalence relationship.
SURD discovers equivalence and subsumption relationships by
populating the ontologies with instances from textual annotations
and using heuristics based on the shared instances of two concepts
Fig. 1. Overview of the Subsumption Relations Discovery (SURD)
technique
3.1</p>
      <p>
        Using Annotations as Instances
We propose to populate ontologies with annotated phrases of
text from publicly available biomedical literature. Two types
of resources can be used: 1) Corpora manually annotated with
ontology concepts (e.g. GENIA Corpus
        <xref ref-type="bibr" rid="ref12">(Kim et al., 2003)</xref>
        , GRO
Corpus
        <xref ref-type="bibr" rid="ref14">(Kim et al., 2011)</xref>
        ) and 2) automatic ontology concept
annotations by using tools such as MetaMap
        <xref ref-type="bibr" rid="ref1">(Aronson, 2001)</xref>
        ,
which is based on the UMLS Metathesaurus, and the NCBO
Annotator
        <xref ref-type="bibr" rid="ref11">(Jonquet et al., 2009)</xref>
        , an ontology-independent tool.
In this paper, we compare the GENIA and GRO corpora, which
are based on the GENIA ontology and the Gene Regulation
Ontology (GRO) respectively, with the UMLS Metathesaurus-based
annotations by MetaMap.
      </p>
      <p>Given a pair of ontologies Oi and Oj , a corpus P consisting
of n documents, and two annotators Ai and Aj which annotate
the documents using Oi and Oj , respectively, we annotate the
documents in P using Ai and Aj to get two annotated corpora
Pi and Pj . Each phrase (or mention) m® in document d¯ of P
annotated with a concept C° 2 Oi(j) is then made an instance of
C° . Essentially, our objective is to compare two sets of annotations
on the same set of documents to find out which pairs of concepts
are frequently used to annotate the same mentions as subsumption
relationships potentially exist between these pairs.</p>
      <p>The first step of our method is to locate mentions annotated by
both annotators. This is not always straightforward because different
annotators have different guidelines for annotation, particularly with
regards to mention boundary. For example, given the sentence
“spiB, like spi-1, was found to be expressed in various murine and
human hematopoietic cell lines...”, annotator A1 might annotate
the mention hematopoietic cell lines with the concept Cell while
annotator A2 might annotate the mention cell lines with the concept
Cell Line. In this example, cell lines and hematopoietic cell lines
refer to the same semantic entity and thus, the concepts Cell and
Match
mentions
produces</p>
      <p>Equivalent
mentions</p>
      <p>Find
subsumptions
based on shared</p>
      <p>instances
used in populating OntOoljogy</p>
      <p>Legend</p>
      <p>Process
Data
Ontology
Input
(to process)
Cell Line share the same mention and form a candidate pair for
subsumption. We consider two mentions to be matches if they have
the same head noun.
3.2</p>
      <p>Finding Subsumptions based on Shared Instances
We use an indicator known as the Co-Annotation Ratio (CAR)
to determine subsumption relationships. The Co-Annotation Ratio
between two concepts Cp 2 Op and Cq 2 Oq, CARpq, computes
the ratio of mentions annotated with both Cp and Cq to the number
of mentions annotated with Cp, and is expressed by the following
equation:</p>
      <p>CARpq = jfmpjmp : Cp; mq : Cq; mp ´ mqgj</p>
      <p>jfmpjmp : Cpgj
where the notation m : C, defines m to be an instance of concept
C and mp ´ mq is true if mp and mq are matched in the
mentionmatching step. CAR is asymmetric and we compare CARij and
CARji in order to determine the relationship between Ci and Cj .
We propose the following heuristics using the two indicators to
determine the concept relation:
1. If CARij is high and CARji is low, then Ci @ Cj
2. If CARij is low and CARji is high, then Ci A Cj
3. If CARij is high and CARji is high, then Ci ´ Cj
4. If CARij is low and CARji is low, then Ci ? Cj</p>
      <p>The first rule states that, if a large proportion of the instances
(or mentions) belonging to Ci also belongs to Cj but only a small
proportion of the instances belonging to Cj belong to Ci, then
Ci is highly possible to be a subsumee of Cj . In fact, this is a
relaxation to the definition of a subsumption relation which depicts
that C® @ C¯ if and only if all instances of C® are also instances
of C¯ . We introduce the relaxed heuristic in order to enhance the
sensitivity of subsumption relation identification. The second rule
represents the converse of the first. The third rule states that if a
large proportion of the instances belonging to Ci also belong to Cj
and vice versa, we consider the two concepts to be equivalent. This
method of statistical analysis allows us to identify both equivalence
and subsumption relations at the same time. Lastly, if both Ci and
Cj have large proportions of instances which are not common, Ci
and Cj are most likely disjoint. In SURD, we consider a CAR ¸ 0:5
to be high and a CAR &lt; 0:5 to be low.
4</p>
    </sec>
    <sec id="sec-4">
      <title>EXPERIMENT AND RESULTS</title>
      <p>
        Experiments were performed on two pairs of ontologies using
two different corpora. The first is the GRO corpus with 200
PubMed abstracts and the second is the 2008 version of the GENIA
corpus consisting of 1000 PubMed abstracts. The two corpora
were manually annotated by human experts with concepts of
biological entities from two ontologies, namely the Gene Regulation
Ontology
        <xref ref-type="bibr" rid="ref2">(Beisswanger et al., 2008)</xref>
        , and the GENIA ontology
        <xref ref-type="bibr" rid="ref13">(Kim
et al., 2006)</xref>
        , respectively. 10400 mentions in the GRO Corpus
were manually annotated using 212 unique GRO concepts while
54533 mentions were manually annotated using 46 unique GENIA
concepts. We then annotated each corpus automatically using
MetaMap to get annotations based on the UMLS Metathesaurus.
17119 mentions in the GRO Corpus were annotated using 3063
unique UMLS concepts by MetaMap while 99626 mentions in the
GENIA Corpus were annotated using 5796 unique UMLS concepts.
Since the Metathesaurus is not a formal ontology1, we adopted the
OWL version of the Semantic Network ontology2 and extended it
by adding the Metathesaurus concepts used by MetaMap in the
annotation of the GRO Corpus and the GENIA Corpus to get
two ontologies, U M LSGRO and U M LSGENIA, respectively3.
SURD is then used to discover subsumptions between GRO and
U M LSGRO, and also between GENIA and U M LSGENIA.
Henceforth, we use UMLS to indicate either U M LSGRO or
U M LSGENIA when the corpus being referred to is clear.
      </p>
      <p>The three ontologies were chosen because they have different
granularities. The GENIA ontology is a coarse-grained ontology
with leaf concepts which are general like Protein Molecule and
Carbohydrate. On the other hand, the Metathesaurus has a wide
coverage and its leaf concepts are mostly fine-grained and very
specific (e.g. p56 and Glucose). Therefore, we can expect to find
many subsumption relations between the two ontologies. GRO is
relatively coarse-grained, as compared to the Metathesaurus, but
has very specific concepts regarding the domain of gene regulation.
We show that SURD works well with the domain-specific ontology
GRO as well as with the generic GENIA ontology.</p>
      <p>
        The output of SURD is a set of triplets ASURD(Oi; Oj ) =
f&lt; Ci; R; Cj &gt;g. We evaluated this output ASURD(Oi; Oj )
by measuring the precision of a randomly chosen subset
ASRURD(Oi; Oj ) through manual validation by a biologist. We
were not able to measure the recall as we do not have a complete
reference set of subsumption relations between GRO-UMLS and
GENIA-UMLS. Since subsumption relations can be inferred from
equivalence relations, we also mark the triplets in ASURD(Oi; Oj )
which are inferrable from equivalence relations. This allows us to
find the discovered subsumption relations which are not redundant
and truly useful. The steps taken in our evaluation are as follows:
1. Finding relations in ASURD(Oi; Oj ) that are inferrable from
equivalence relations
a. We use BOAT
        <xref ref-type="bibr" rid="ref4">(Chua and Kim, 2012)</xref>
        , a matcher for finding
equivalence relations, to find all equivalence relations
between Oi and Oj to get ABOAT (Oi; Oj ).
b. ABOAT (Oi; Oj ) is expanded to include subsumption
relations which can be inferred from equivalence relations.
For each equivalence correspondence Ci ´ Cj , we add the
relations Cid @ Cja and Cia A Cjd for all Cid and Cjd,
descendants of Ci and Cj , respectively, as well as all Cia
and Cja, which are ancestors of Ci and Cj , respectively.
c. Triplets in ASURD(Oi; Oj ) that are found in ABOAT (Oi; Oj )
are marked as inferrable.
2. Estimating the precision of ASURD(Oi; Oj )
a. Randomly select a subset of n triplets ASRURD(Oi; Oj ),
from ASURD(Oi; Oj ).
b. A biologist familiar with the domain and ontologies
involved examines each concept pair (Ci; Cj ) from triplet
&lt; Ci; R; Cj &gt;2 ASRURD(Oi; Oj ) and assigns a relation
Rm 2 f@; A; ´; ?g to the pair.
1 http://www.nlm.nih.gov/pubs/factsheets/umlsmeta.html
2 http://krono.act.uji.es/people/Ernesto/UMLS SN OWL
3 The extended ontologies are available at http://nlp.sce.ntu.
edu.sg/SURD
c. A triplet &lt; Ci; R; Cj &gt;2 ASRURD(Oi; Oj ) is correct if
      </p>
      <p>R = Rm.
d. Precision = Number of correct triplets in ASRURD(Oi; Oj )
n</p>
    </sec>
    <sec id="sec-5">
      <title>5 AUTOMATIC CORPUS ANNOTATION</title>
      <p>We make use of the subsumption and equivalence relations
discovered by SURD for automatic ontological corpus annotation.
This application is dependent upon UMLS, which is a well-known
lexical resource in the biomedical domain. By using MetaMap,
which automatically recognizes UMLS terms in text, we can locate
the instances of the UMLS Metathesaurus concepts and then link
them to the corresponding concepts of GENIA ontology and GRO
through the subsumption and equivalence relations. Note that we
can infer generalizations, but not specificities. In other words,
we can use CGRO w CUMLS relations, but not CUMLS A
CGRO relations. For example, we can infer that a mention NF
kappa B annotated with the concept Transcription Factor is also
a Protein if Transcription Factor @ Protein is true. However, we
cannot infer anything about the same mention from the subsumption
SOX9 @ Transcription Factor. The automatic annotation of
text with GRO concepts is a three-step process, as shown in
Figure 2. Sentences are first automatically annotated with UMLS
Metathesaurus concepts using MetaMap. Next, GRO concepts
which are equivalent to or more general than the UMLS concepts
are retrieved from the correspondences found by SURD. Lastly, the
retrieved GRO concepts are used to annotate the mentions which
their corresponding UMLS concepts were used to annotate.</p>
      <p>The upstream region of the human homeobox gene HOX3D is a target for
regulation by retinoic acid and HOX homeoproteins.</p>
      <p>1) Annotate sentence with MetaMap
The upstream region of the human homeobox gene
[UMLS: C1415679 (HOX3D)] HOX3D is a target for regulation by
[UMLS: C0040845 (Retinoic Acid)] retinoic acid and
[UMLS: C0242617 (Homeoproteins)] HOX homeoproteins.</p>
      <p>2) Look up subsumptions between UMLS and GRO</p>
      <p>concepts
UMLS: C1415679 (HOX3D)
UMLS: C0040845 (Retinoic Acid)
UMLS: C0242617 (Homeoproteins)
&lt;
&lt;
&lt;</p>
      <p>GRO: Homeobox
GRO: Retinoic Acid</p>
      <p>GRO: Protein
3) Convert MetaMap annotations to GRO annotations</p>
      <p>using subsumptions
The upstream region of the human homeobox gene
[GRO: Homeobox] HOX3D is a target for regulation by
[GRO: Organic Chemical] retinoic acid and
[GRO: Protein] HOX homeoproteins.</p>
      <p>To evaluate the performance, we use a cross-validation approach
where Precision, Recall and F-Measure are used as performance
measures. The following steps were carried out to evaluate SURD
when used for the automatic annotation of GRO Corpus with GRO
concepts by using MetaMap. The process was repeated for the
annotation of GENIA corpus with GENIA ontology concepts by
using MetaMap and any reference to GRO can be replaced with
GENIA for the second experiment.</p>
      <p>1. Split the document sets, PUMLS and PGRO (i.e. the
GRO corpus annotated with UMLS and GRO concepts,
respectively), into 10 folds: F0; F1; : : : F9.
2. For each iteration t from 0 to 9, find the set of
t
triplets ASURD(GRO; U M LS) using SURD, based on the
annotations in the documents in all folds but Ft.</p>
      <p>t
3. Filter ASURD(GRO; U M LS) to keep only those triplets &lt;</p>
      <p>CGRO; R; CUMLS &gt; where R 2 f´; Ag
4. For each mention mi of fold Ft annotated with CUMLSi
by MetaMap in PUMLS , we annotate mi with each
concept CGROi® where &lt; CGROi®; w; CUMLSi &gt;2
t</p>
      <p>ASURD(GRO; U M LS).
5. Consequently, a mention mi in fold Ft of PUMLS is annotated
with zero or more GRO concepts, which forms a set Xi =
fCGROi®jCUMLSi v CGROi®g. We use the reference
concept CG0ROi to determine if mi is cross-annotated correctly,
where CG0ROi is the concept used to manually annotate m0i,
the matching mention of mi in PGRO. We find the average
Precision, Recall and F-Measure over all folds for a corpus
containing k mentions using:
² Precision = §ikjfCGROi®2XijCGROi®wCG0ROigj</p>
      <p>§ikjXij
² Recall = §ikjfCG0ROij9CGROi®2Xi;CGROi®wCG0ROigj
§ikjfCG0ROigj
² F-Measure = 2£P recision£Recall</p>
      <p>P recision+Recall</p>
      <p>Automatic annotation was also performed using the subsumption
relations found by BOAT (as described in 4) as well as those found
using Hearst patterns. We were not able to compare with CSR as
the tool is not publicly available. After manually validating all the
Hearst patterns in the two corpora, we were able to find only 3
subsumption relations for GRO-UMLS and 14 for GENIA-UMLS.</p>
      <p>Table 3 shows the performance of automatic ontology annotation
using subsumption relations from the three techniques. Though the
annotations made using BOAT’s inferred relations have the highest
recall for the GRO Corpus, it is achieved at the cost of precision.
Similarly, the high precision of the Hearst method on the GENIA
Corpus is achieved at the expense of recall. SURD has the highest
precision for the GRO Corpus, the highest recall for the GENIA
Corpus, and the highest F-measures for both corpora. The last row
of Table 3 shows the average distance between reference annotation
CG0RO and its closest match CGRO identified using automatic
annotation, for all CG0ROs that have matches. An average distance
close to 0 means that the automatic annotations are mostly identical
to the manual annotations, while a large average distance means that
mentions are often matched to more general concepts than those
of manual annotations. SURD has very small average distances
for both corpora. This shows that in addition to having higher
coverage, automatic annotations using SURD are almost identical
to the manual annotations.</p>
      <p>GRO UMLS GENIA UMLS</p>
      <p>SURD BOAT Hearst SURD BOAT Hearst
Precision 0.866 0.491 0.8 0.839 0.843 0.896</p>
      <p>Recall 0.577 0.664 0.001 0.735 0.539 0.050
F-Measure 0.693 0.565 0.002 0.783 0.658 0.096
Avg. Dist 0.038 1.4 0 0 3.1 1.0</p>
      <p>Table 3. Automatic ontological corpus annotation results</p>
    </sec>
    <sec id="sec-6">
      <title>6 CONCLUSION AND FUTURE WORK</title>
      <p>We have presented a novel technique for discovering cross-ontology
subsumption relations which uses ontological annotations on
biomedical text corpora to determine subsumption relations between
concepts that share mentions. The relations discovered are highly
precise and have wide coverage and can thus be used for integrating
a pair of ontologies with minimal expert curation. We also showed
that they can be effectively used for automated cross-ontology
annotations on biomedical corpora. For future work, we plan to
apply SURD to other biomedical ontologies and also complement
the equivalence relations found by BOAT with the subsumption
relations found by SURD for the integration of ontologies populated
with annotations so as to effectively perform semantic querying on
biomedical literature.</p>
    </sec>
    <sec id="sec-7">
      <title>ACKNOWLEDGEMENTS</title>
      <p>The authors would like to thank Xu Han for helping to validate the
subsumption relations.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Aronson</surname>
            ,
            <given-names>A. R.</given-names>
          </string-name>
          (
          <year>2001</year>
          ).
          <article-title>Effective mapping of biomedical text to the UMLS Metathesaurus: The MetaMap Program</article-title>
          .
          <source>In Proceedings of the AMIA Annual Symposium (AMIA</source>
          <year>2001</year>
          ), pages
          <fpage>17</fpage>
          -
          <lpage>21</lpage>
          , Portland, Oregon, USA.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Beisswanger</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
          </string-name>
          , J.-J.,
          <string-name>
            <surname>Rebholz-Schuhmann</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Splendiani</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dameron</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schulz</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Hahn</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          (
          <year>2008</year>
          ).
          <article-title>Gene Regulation Ontology (GRO): Design principles and use cases</article-title>
          .
          <source>In Studies in Health Technology and Informatics</source>
          , volume
          <volume>136</volume>
          , pages
          <fpage>9</fpage>
          -
          <lpage>14</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Chua</surname>
            ,
            <given-names>W. W. K.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Goh</surname>
            ,
            <given-names>A. E. S.</given-names>
          </string-name>
          (
          <year>2010</year>
          ).
          <article-title>Techniques for discovering correspondences between ontologies</article-title>
          .
          <source>International Journal of Web and Grid Services</source>
          ,
          <volume>6</volume>
          (
          <issue>3</issue>
          ),
          <fpage>213</fpage>
          -
          <lpage>243</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Chua</surname>
            ,
            <given-names>W. W. K.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.-J.</surname>
          </string-name>
          (
          <year>2012</year>
          ).
          <article-title>BOAT: Automatic alignment of biomedical ontologies using term informativeness and candidate selection</article-title>
          .
          <source>Journal of Biomedical Informatics</source>
          ,
          <volume>45</volume>
          (
          <issue>2</issue>
          ),
          <fpage>337</fpage>
          -
          <lpage>349</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Doan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Madhavan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Domingos</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Halevy</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2004</year>
          ).
          <article-title>Ontology matching: A machine learning approach</article-title>
          .
          <source>In Handbook on Ontologies in Information Systems</source>
          , pages
          <fpage>397</fpage>
          -
          <lpage>416</lpage>
          . Springer.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Ehrig</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Staab</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Sure</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          (
          <year>2005</year>
          ).
          <article-title>Bootstrapping ontology alignment methods with APFEL</article-title>
          .
          <source>In Proceedings of the 4th International Semantic Web Conference (ISWC</source>
          <year>2005</year>
          ), pages
          <fpage>186</fpage>
          -
          <lpage>200</lpage>
          , Galway, Ireland. Springer.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Euzenat</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Shvaiko</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          (
          <year>2007</year>
          ). Ontology matching. Springer-Verlag.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Ghazvinian</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Noy</surname>
            ,
            <given-names>N. F.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Musen</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          (
          <year>2010</year>
          ).
          <article-title>How orthogonal are the OBO Foundry Ontologies</article-title>
          ?
          <source>In Proceedings of Bio-Ontologies</source>
          <year>2010</year>
          :
          <article-title>Semantic Applications in Life Sciences</article-title>
          , pages
          <fpage>164</fpage>
          -
          <lpage>167</lpage>
          , Boston, USA.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Hearst</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          (
          <year>1992</year>
          ).
          <article-title>Automatic acquisition of hyponyms from large text corpora</article-title>
          .
          <source>In Proceedings of the 14th International Conference on Computational Linguistics (COLING)</source>
          , pages
          <fpage>539</fpage>
          -
          <lpage>545</lpage>
          , Nantes, France.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Jean-Mary</surname>
            ,
            <given-names>Y. R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shironoshita</surname>
            ,
            <given-names>E. P.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Kabuka</surname>
            ,
            <given-names>M. R.</given-names>
          </string-name>
          (
          <year>2009</year>
          ).
          <article-title>Ontology matching with semantic verification</article-title>
          .
          <source>Journal of Web Semantics</source>
          ,
          <volume>7</volume>
          (
          <issue>3</issue>
          ),
          <fpage>235</fpage>
          -
          <lpage>251</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Jonquet</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shah</surname>
            ,
            <given-names>N. H.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Musen</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          (
          <year>2009</year>
          ).
          <article-title>The Open Biomedical Annotator</article-title>
          .
          <source>In Proceedings of the AMIA Summit on Translational Bioinformatics</source>
          , pages
          <fpage>56</fpage>
          -
          <lpage>60</lpage>
          , San Francisco, CA, USA,.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.-D.</surname>
          </string-name>
          ,
          <string-name>
            <surname>Ohta</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tateisi</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <article-title>and ichi</article-title>
          <string-name>
            <surname>Tsujii</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2003</year>
          ).
          <article-title>GENIA corpus - a semantically annotated corpus for bio-textmining</article-title>
          .
          <source>Bioinformatics</source>
          ,
          <volume>19</volume>
          (
          <issue>suppl 1</issue>
          ),
          <fpage>i180</fpage>
          -
          <lpage>i182</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.-D.</surname>
          </string-name>
          ,
          <string-name>
            <surname>Ohta</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Teteisi</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Tsujii</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2006</year>
          ).
          <article-title>GENIA ontology (TR-NLP-UT2006-2)</article-title>
          .
          <source>Technical report</source>
          , Tsujii Laboratory, University of Tokyo.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>Kim</surname>
            , J.-J., Han,
            <given-names>X.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Chua</surname>
            ,
            <given-names>W. W. K.</given-names>
          </string-name>
          (
          <year>2011</year>
          ).
          <article-title>Annotation of biomedical text with Gene Regulation Ontology: Towards semantic web for biomedical literature</article-title>
          .
          <source>In The Fourth International Symposium on Languages in Biology and Medicine (LBM</source>
          <year>2011</year>
          ), pages
          <fpage>63</fpage>
          -
          <lpage>70</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>Kirsten</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thor</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Rahm</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          (
          <year>2007</year>
          ).
          <article-title>Instance-based matching of large life science ontologies</article-title>
          .
          <source>In Proceedings of Data Integration in the Life Sciences (DILS)</source>
          , pages
          <fpage>172</fpage>
          -
          <lpage>187</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <surname>Spiliopoulos</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vouros</surname>
            ,
            <given-names>G. A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Karkaletsis</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          (
          <year>2010</year>
          ).
          <article-title>On the discovery of subsumption relations for the alignment of ontologies</article-title>
          .
          <source>Journal of Web Semantics</source>
          ,
          <volume>8</volume>
          (
          <issue>1</issue>
          ),
          <fpage>69</fpage>
          -
          <lpage>88</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <surname>van Hage</surname>
            ,
            <given-names>W. R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Katrenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Schreiber</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          (
          <year>2005</year>
          ).
          <article-title>A method to combine linguistic ontology-mapping techniques</article-title>
          .
          <source>In Proceeedings of 4th International Semantic Web Conference (ISWC</source>
          <year>2005</year>
          ), pages
          <fpage>732</fpage>
          -
          <lpage>744</lpage>
          , Galway, Ireland.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>