<!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>Auditing Redundant Import in Reuse of a Top Level Ontology for the Drug Discovery Investigations Ontology</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Zhe He</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Christopher Ochs</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Larisa Soldatova</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yehoshua Perl</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sivaram Arabandi</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>James Geller</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Brunel University</institution>
          ,
          <addr-line>London</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>NJIT</institution>
          ,
          <addr-line>Newark, NJ</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Ontopro LLC</institution>
          ,
          <addr-line>Houston, TX</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The use of a top-level ontology, e.g. the Basic Formal Ontology (BFO), as a template for a domain ontology is considered a best practice. This saves design efforts and supports multi-disciplinary research. The Drug Discovery Investigations ontology (DDI) for automated drug discovery investigations followed the best practices and imported BFO. However not all BFO classes were used. Quality assurance is an important process in the development of ontologies. One methodology proven to support quality assurance is based on automatic derivation of abstraction networks (ANs) from the original ontologies. An AN of an ontology is a compact secondary network summarizing the ontology. ANs were shown to support the identification of sets of concepts with higher concentrations of errors than control sets. In this paper, an AN is derived for the DDI, based on object properties. The top node of this AN represents a set of 81 classes without any object properties. Nodes of an AN representing many classes tend to indicate modeling errors. Upon reviewing these 81 classes, we discovered that among them are most of the classes imported from BFO, and that most of these classes are irrelevant for DDI. An algorithm for hiding such irrelevant classes from a specified ontology is described. As many as 18 (56%) of the 32 BFO classes represented by the top node of the AN were hidden from DDI by the algorithm. We conclude that ontologies reusing a top-level ontology should employ this AN-based approach.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        The use of a top-level ontology as a template for a domain
ontology is considered a best practice in ontology
engineering. A well-developed top-level ontology eases the
development of domain ontologies and reduces possible errors
and inconsistencies. The Open Biomedical Ontologies
(OBO) Foundry (www.obofoundry.org) recommends the
use of the Basic Formal Ontology (BFO)
(www.ifomis.org/bfo) as a top-level ontology for
biomedical ontologies. The ontology of Drug Discovery
Investigations (DDI) has been developed to support automated
drug discovery investigations run by a Robot Scientist
“Eve”
        <xref ref-type="bibr" rid="ref7">(Qi et al. 2010)</xref>
        . DDI defines the essential entities for
the recording and reasoning with data about the biological
activity of compounds. A logically consistent description of
the data and knowledge in the project is essential for the
automation of scientific discovery
        <xref ref-type="bibr" rid="ref4">(King et al. 2009)</xref>
        .
      </p>
      <p>DDI has been designed to be easily extendible to and
compatible with other applications. Consequently DDI uses
BFO and the RO (Relations Ontology) as design templates,
and extends BFO by classes for drug design. For example
the class role has been extended by the subclasses drug role,
agonist role, etc. Some imported BFO classes were left
unused, e.g., the class connected_temporal_region. “Unused”
means that there are no child classes introduced, and no
object properties added to an imported class.</p>
      <p>Since ontologies intend to facilitate the representation
of semantics for humans and computers, it is important that
the navigation through an ontology by humans and during
automated reasoning be efficient. Therefore unused classes
diminish the usability of the ontology, because they
unnecessarily complicate it. The simplification of the DDI by the
removal of even a few classes has a considerable impact on
efficiency. Eve runs thousands of parallel experiments and
records millions of data items. Therefore any unused classes
should be hidden from the data recording procedures as
soon as the domain ontology has reached a stable state. At
the current state-of-the-art this is not standard practice,
because there is no easy way to identify and hide such classes.
Reasoners do not report them as problematic. Ontology
evaluation criteria are not explicit in regard to unused
classes.</p>
      <p>To be reliably usable, ontologies need to go through a
Quality Assurance (QA) process, e.g. as a part of a larger
software system. QA may involve an auditing regimen for
discovering modeling errors and inconsistencies in the
ontology. Without such an auditing process, the errors in an
ontology may cause a malfunction of an information system
using the ontology. A part of QA should be the hiding of
imported classes that are not used by the domain ontology.
We refer to this process as “hiding the redundant imports.”</p>
      <p>
        One of the methodologies proven to support QA is
based on the automatic derivation of an Abstraction
Network (AN) from an original ontology
        <xref ref-type="bibr" rid="ref3 ref8">(Wang et al. 2007)</xref>
        .
An AN of an ontology is a compact secondary network
summarizing the structure and content of the ontology. ANs
were shown to support the identification of sets of concepts
with higher concentrations of errors than randomly chosen
control sets
        <xref ref-type="bibr" rid="ref3 ref8">(Halper et al. 2007)</xref>
        . Focusing QA efforts on
such sets increases the yield of QA personnel, measured in
number of problems found and corrected per unit of time.
      </p>
      <p>
        In this paper, an AN is derived for the DDI, based on
domain-defined and restriction-defined object properties,
referred to as a partial area taxonomy
        <xref ref-type="bibr" rid="ref6">(Ochs et al. 2013)</xref>
        .
The top node of this taxonomy is the Entity node,
representing 81 classes (12.5% of all DDI classes) that do not have
any object properties. Large groups of classes represented
by a single node in an AN, especially by the top node, tend
to have a high concentration of modeling errors
        <xref ref-type="bibr" rid="ref5 ref6">(Ochs et al.
2012; Ochs et al. 2013)</xref>
        . Upon reviewing the classes
summarized by the top node, we discovered that they contain
most BFO classes.
      </p>
      <p>BFO has no object properties and most classes
imported from BFO were not used in the DDI and should be
hidden from the DDI. An algorithm for hiding this “redundant
portion” of BFO from DDI will be discussed. As many as
18 (56%) of the 32 BFO classes in the top node will be
hidden from a subsequent release of DDI. All ontologies
importing a top-level ontology should employ this AN-based
approach to QA, for hiding redundant top level classes.
2</p>
    </sec>
    <sec id="sec-2">
      <title>METHODS</title>
      <p>
        In previous research, two kinds of ANs, called area
taxonomies and partial area taxonomies have been developed to
support QA for Systematized Nomenclature of Medicine –
Clinical Terms (SNOMED CT)
        <xref ref-type="bibr" rid="ref3 ref8">(Wang et al. 2007)</xref>
        . We
have also derived taxonomies for OWL-based ontologies
that use similar but not identical definitional elements for
orientation and QA. The AN derivation and QA
methodologies were successfully applied to the Ontology of Clinical
Research (OCRe)
        <xref ref-type="bibr" rid="ref5">(Ochs et al. 2012)</xref>
        and the Sleep Domain
Ontology (SDO)
        <xref ref-type="bibr" rid="ref6">(Ochs et al. 2013)</xref>
        . An area is defined as
the set of all classes that are explicitly defined or inferred as
being exactly in the domains of a given set of object
properties. The list of names of the object properties is used to
name the area. In general, the object properties that define
an area can all be “domain-defined,” or all be
“restrictiondefined” or there may be a mix of both.
      </p>
      <p>Areas are connected by child-of links derived from the
underlying ontology’s subclass links. A root of an area is
defined as a class that has no parents in the same area (i.e.
none of its parents share its set of object properties). An area
may have more than one root. Every root of an area defines
a partial area: a set of classes that includes this root and all
its descendants in the same area. Just as areas, partial areas
are connected by child-of links derived from underlying
subclass links. Partial area A is a child-of partial area B if a
parent (superclass) of A’s root class resides in B.</p>
      <p>Fig. 1 (a) provides an excerpt of 13 classes taken from
the DDI, along with five object properties. Two object
properties is_conretized_as and is about have explicit domains
(in red), while three object properties has_participant,
has_specified_input, and has_specified_output are used in
class restrictions (in black). Classes that are within the
domain of a particular set of object properties are shown in a
dashed bubble, e.g., the class
generally_dependent_continuant is in the domain of the object
property is_concretized_as. Information content entity is
explicitly defined as the domain of is about, but it also
inherits is_concretized_as from
generally_dependent_continuant. Conformation and contact
information are both implicitly in the domain of is about and
is_concretized_as due to inheritance from Information
content entity.</p>
      <p>Fig. 1(b) shows the area taxonomy for the excerpt of
DDI in Fig. 1(a). Generally_dependent_continuant, within
the domain of is_concretized_as, is represented by the area
with the name “is_concretized_as.” Child-of links are
shown as lines connecting the areas. Areas are organized
into color-coded levels based-on their numbers of object
properties. Areas with more object properties are lower
down in the diagram.</p>
      <p>Fig. 1(c) shows the partial area taxonomy for Fig. 1(a).
Partial areas are represented by white boxes within area
boxes. Each partial area is named by its root. The number of
classes (including the root) in a partial area is shown in
parentheses. For example, in the area named
“has_specified_input, has_specified_output”, there are two partial
areas “data item extraction from journal article” and
“documenting,” each containing one class. We derived the partial
area taxonomy for the DDI Entity hierarchy (Fig. 2).</p>
      <p>Our methodology hides all the classes that were
imported from a top-level ontology T into a domain ontology
O, but were not utilized in O. In this paper, we are only
considering top-level ontologies without object properties.
Hence, a class C of T can be reused when constructing O by
either associating object properties in O with C, or by
modeling new classes of O as children or descendants of C. By
limiting ourselves to classes of O in the root partial area R
in the taxonomy of O, we are automatically limiting our
attention to classes imported from T without any object
properties in O. If a class of T has an object property in O
(there are a seven such classes of BFO in DDI) then such a
class cannot exist in the root partial area R of the taxonomy.</p>
      <p>In addition, if a class in R was imported from T and is
a leaf in O then, it was not utilized as the parent of any
domain-related classes in O. Hence, such classes of O
(Timported classes, for short) are irrelevant for O and should
be hidden. Following BFO, DDI and many BioPortal
ontologies, we furthermore assume, in this paper, that no classes
of T and O have multiple parents. In other words, the
hierarchies of T and O are trees, which simplifies algorithmic
processing.</p>
      <p>We describe (but do not show) a recursive algorithm
Hide(R, O, T, v) to automate the process of hiding unused
T-imported classes from O. The algorithm uses three
different contexts O, R and T, and operates in these contexts.
Hide performs a post-order traversal of the classes in R.
First, Hide is recursively applied to all subclasses w of the
argument class v in R, initiating at R’s root. When the
traversal backtracks to v, the algorithm checks whether v is a
leaf in O. Note that v may have been a leaf in O before, or
may have become a leaf due to the removal of all its
subclasses in O. Furthermore, if v was T-imported into O and is
not in the range of an object property of O, then it is not
used at all in O and needs to be hidden from O. By limiting
the traversal to R, Hide is efficient with O(|R|) complexity,
where R is only a small part of O, since the post-order
traversal of a tree hierarchy is linear in the number of its nodes.
However, the test whether a class is internal is done in O
and not in R, because a leaf in R with subclasses in O was
reused in O’s modeling and should not be hidden from O.
3</p>
    </sec>
    <sec id="sec-3">
      <title>RESULTS</title>
      <p>DDI’s Entity hierarchy contains 614 classes, which is 97.8%
of DDI. There are 24 object properties, 14 of which are used
within restrictions, 13 are given explicitly defined domains,
and three have both.</p>
      <p>
        First, we utilized the partial area taxonomy derivation
methodology described by Ochs
        <xref ref-type="bibr" rid="ref6">(Ochs et al. 2013)</xref>
        to derive
the domain-defined or restriction-defined taxonomy of
DDI’s Entity hierarchy (614 classes) (Fig. 2). It contains 27
partial areas in 20 areas including five large partial areas
(over 20 classes) and four medium size partial areas (of 5-20
classes). The other 18 partial areas include one class each.
By reviewing the nine large and medium partial areas, e.g.
chemical entity (39), information content entity (95), and
document part (11), the user of DDI obtains a summary of
the nature of classes in DDI. The names and sizes of these
nine partial areas communicate knowledge about their
content, supporting user orientation into DDI. The taxonomy
also displays the interaction among 18 partial areas of one
class each, for sophisticated users, e.g. DDI curator, who are
interested in orientation into the fine details of DDI’s
content and structure.
      </p>
      <p>Entity (2)
continuant (3)
occurent (3)
processual_entity (6)
fiat_process_part
process (2)
process_aggregate
process_boundary
processual_context
spatiotemporal_region
connected_spatiotemporal_region
spatiotemporal_instant
spatiotemporal_interval
scattered_spatiotemporal_region
temporal_region
connected_temporal_region
temporal_instant
temporal_interval
scattered_temporal_region
Legend: LL Leaf; LL Parent of leaves; LL Grandparent of leaves
Fig. 3. Excerpt of BFO classes in Entity partial area before hiding</p>
      <p>Finally, we executed the algorithm Hide(Entity, DDI,
BFO, entity), where entity is the root class of the root partial
area Entity, which is the partial area the algorithm traverses.</p>
      <p>Out of 81 classes of the partial area Entity, 32 are
BFOimported. An excerpt of these BFO classes, focusing on
descendants of occurent, is shown in an indented format in
Fig. 3. Seven other BFO-imported classes have object
properties added in DDI and thus should not be hidden. Four
external subclasses of spatial region appear in ranges of
object properties, and should also not be hidden. A number
in parentheses in Fig. 3 indicates the number of children in
O.</p>
      <p>The 10 BFO-imported classes highlighted in yellow do
not have any added DDI class descendants and are not used
in range specifications of object properties. After these
classes are hidden, the two classes in blue will appear as leaves
and are also hidden. Then, the classes in red are hidden
when they will appear as leaves. The curator of DDI
(coauthor LS) will hide the 18 unused BFO classes in a new
release of DDI once the hiding mechanism is supported by
BioPortal. There are only 14 reused classes from BFO in the
Entity partial area that remain after hiding the 18 unused
classes.
4</p>
    </sec>
    <sec id="sec-4">
      <title>DISCUSSION</title>
      <p>Reuse of a top-level ontology is quite common in BioPortal,
i.e., at least 36 ontologies contain BFO classes. Since an
ontology designer often does not know which top-level
ontology classes will later be used, the common practice is to
import the whole ontology. However, once a domain
ontology is mature, there is no efficient way to remove unused
classes. Our methodology hides the unused imports
assuming that both ontologies have a tree hierarchy. We use a
partial area taxonomy to limit the input size of the algorithm.</p>
      <p>
        Following (www.imbi.uni-freiburg.de/ontology/), we
distinguish between top-level, top-domain and domain
ontologies. Reuse is practiced at two levels. Some top-domain
ontologies such as BioTop
        <xref ref-type="bibr" rid="ref2">(Beisswanger et al. 2008)</xref>
        and
OGMS (bioportal.bioontology.org/ontologies/1414) are
reusing BFO, while SDO
        <xref ref-type="bibr" rid="ref1">(Arabandi 2010)</xref>
        reuses OGMS
and thus indirectly also reuses BFO. There is a need to
avoid a proliferation of unused imported classes.
      </p>
      <p>In this paper, both the top level and the domain ontology
have a tree hierarchy, but this is not always the case. OGMS
has a tree hierarchy but SDO and the BioTop top-domain
ontology do not. Hence, future research needs to consider
cases where both ontologies do not have tree hierarchies.
Furthermore, some top-domain ontologies such as BioTop,
have object properties, another research consideration.
5</p>
    </sec>
    <sec id="sec-5">
      <title>CONCLUSIONS</title>
      <p>We described a recursive linear algorithm for hiding unused
imported top-level ontology classes of an OWL-based
ontology. The algorithm was demonstrated, hiding
BFOimported classes from the DDI.</p>
    </sec>
    <sec id="sec-6">
      <title>ACKNOWLEDGMENTS</title>
      <p>This work has been partially supported by the BRIEF award,
Brunel University, London. We thank Natasha Noy of
NCBO for her help.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Arabandi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2010</year>
          ).
          <article-title>Developing a Sleep Domain Ontology</article-title>
          . AMIA TBI/CRI Summt. San Francisco, CA.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Beisswanger</surname>
            , E.,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Schulz</surname>
          </string-name>
          , et al. (
          <year>2008</year>
          ).
          <article-title>"BioTop: An Upper Domain Ontology for the</article-title>
          <source>Life Sciences." Appl Ontology</source>
          <volume>3</volume>
          (
          <issue>4</issue>
          ):
          <fpage>205</fpage>
          -
          <lpage>212</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Halper</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          , et al. (
          <year>2007</year>
          ).
          <article-title>"Analysis of error concentrations in SNOMED."</article-title>
          <source>AMIA Annu Symp Proc:</source>
          <fpage>314</fpage>
          -
          <lpage>318</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>King</surname>
            ,
            <given-names>R. D.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Rowland</surname>
          </string-name>
          , et al. (
          <year>2009</year>
          ).
          <article-title>"</article-title>
          <source>The automation of science." Science</source>
          <volume>324</volume>
          (
          <issue>5923</issue>
          ):
          <fpage>85</fpage>
          -
          <lpage>89</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Ochs</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          , et al. (
          <year>2012</year>
          ).
          <article-title>"Deriving an abstraction network to support quality assurance in OCRe."</article-title>
          <source>AMIA Annu Symp Proc:</source>
          <fpage>681</fpage>
          -
          <lpage>689</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Ochs</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>He</surname>
          </string-name>
          , et al. (
          <year>2013</year>
          ).
          <article-title>"Choosing the Granularity of Abstraction Networks for Orientation and Quality Assurance of the Sleep Domain Ontology"</article-title>
          .
          <source>The 4th International Conference on Biomedical Ontology</source>
          . Montreal, QC, Canada.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Qi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R. D.</given-names>
            <surname>King</surname>
          </string-name>
          , et al. (
          <year>2010</year>
          ).
          <article-title>"An ontology for description of drug discovery investigations</article-title>
          .
          <source>" J Integr Bioinform</source>
          <volume>7</volume>
          (
          <issue>3</issue>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Halper</surname>
          </string-name>
          , et al. (
          <year>2007</year>
          ).
          <article-title>"Structural methodologies for auditing SNOMED."</article-title>
          <source>J Biomed Inform</source>
          <volume>40</volume>
          (
          <issue>5</issue>
          ):
          <fpage>561</fpage>
          -
          <lpage>581</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>