<!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>SemanTex: Semantic Text Exploration Using Document Links Implied by Conceptual Networks Extracted from the Texts?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Suad Aldarra</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Emir Mun~oz</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pierre-Yves Vandenbussche</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>V t Novacek</string-name>
          <email>vit.novacek@deri.org</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Fujitsu (Ireland) Limited Airside Business Park</institution>
          ,
          <addr-line>Swords, Co. Dublin</addr-line>
          ,
          <country country="IE">Ireland</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Insight @ NUI Galway (formerly known as DERI) IDA Business Park</institution>
          ,
          <addr-line>Lower Dangan, Galway</addr-line>
          ,
          <country country="IE">Ireland</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>? This work has been supported by the `KI2NA' project funded by Fujitsu Laboratories Limited in collaboration with Insight @ NUI Galway.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Despite of advances in digital document processing, exploration of implicit
relationships within large amounts of textual resources can still be daunting. This
is partly due to the `black-box' nature of most current methods for computing
links (i.e., similarities) between documents (c.f., [1] and [2]). The methods are
mostly based on numeric computational models like vector spaces or
probabilistic classi ers. Such models may perform well according to standard IR evaluation
methodologies, but can be sub-optimal in applications aimed at end users due
to the di culties in interpreting the results and their provenance [3, 1].</p>
      <p>
        Our Semantic Text Exploration prototype (abbreviated as SemanTex) aims
at nding implicit links within a corpus of textual resources (such as articles or
web pages) and exposing them to users in an intuitive front-end. We discover the
links by: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) nding concepts that are important in the corpus; (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) computing
relationships between the concepts; (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) using the relationships for nding links
between the texts. The links are annotated with the concepts from which the
particular connection was computed. Apart of being presented to human users
for manual exploration in the SemanTex interfaces, we are working on
representing the semantically annotated links between textual documents in RDF
and exposing the resulting datasets for particular domains (such as PubMed or
New York Times articles) as a part of the Linked Open Data cloud.
      </p>
      <p>In the following we provide more details on the method and give an example
of its practical application to browsing of biomedical articles. A video example
of a speci c SemanTex prototype to be demonstrated at the conference can be
looked up at http://goo.gl/zL8lJ2.</p>
    </sec>
    <sec id="sec-2">
      <title>Method</title>
      <p>
        Extracting Conceptual Networks. For extracting links between concepts in
the texts we use methods we introduced in [4]. The essentials of the method are
as follows: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) Extracting noun phrases that may refer to domain-speci c
concepts (using either a shallow parser for general texts or biomedical named-entity
recognition tool for life sciences). (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) Computing co-occurrence relationships
between the extracted noun phrases by means of point-wise mutual information
(PMI). (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) Filtering out the relationships with the PMI scores below a threshold.
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) Computing (cosine) similarity relationships based on the co-occurrence ones.
Computing Paths between Documents. From a conceptual network, one
can generate sets of paths leading out from every concept. To prevent a
combinatorial explosion, we limit the paths by two factors: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) the maximum path
length; (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) the minimum product of the edge weights of the path. From the set
of such paths associated with particular nodes, paths between the original
documents (i.e., text-to-text links semantically annotated by the concepts appearing
on them) can be generated using inverted indices of concept-text provenance.
For instance, imagine a text A contains concept x. Now assume that x is related
to a concept y in text B via a path (x; u; v; y). Then we can say the texts A and
B are related by a (x; u; v; y) path.
      </p>
      <p>
        Selecting the Most Relevant Paths. The critical part of the method is
nding out which paths are most promising out of potentially huge numbers of
them. For that we use multi-objective optimisation of several speci c
complexity, coherence and entropy measures introduced in [4]. We follow certain intuitive
assumptions when selecting the path measures to optimise: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) Paths leading
through more complex environs are more informative for a user. (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) Paths
surrounded by many highly balanced (i.e., entropic) topics are more informative.
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) Coherent paths with gradual topical changes on the way are better (less
chaotic, more focused progression from one topic to another en route to the
linked text). (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) It is more interesting, considering an Information Retrieval
point of view, when one ends up in a topically distant (incoherent) area (once
the progress through the topics is gradual, i.e., less random). The result of this
step is a set of optimal (non-dominated) text-to-text paths that can be further
ranked according to their combined score.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Usage</title>
      <p>To demonstrate the SemanTex technology, we have applied it to the corpus of
Parkinson's Disease article abstracts from PubMed which we experimented with
in [4]. As can be seen in Figure 1, the front-end has been incorporated into
a PubMed look-and-feel. Domain-speci c concepts have been highlighted in the
abstract display (the darker the shade, the more the concept is important for the
given abstract). After clicking on any of the highlights, a separate `Path Diagram'
window is displayed where one can navigate paths leading from the selected
concept. The nodes on the paths can be expanded with further connections
while the corresponding related articles are always displayed in the bottom of
the window. Clicking on a related article leads to the article view. One can also
explore articles related by a path to the currently browsed one. A diagram of
paths that connect the articles via the concepts in them can be displayed as well.</p>
      <p>Figure 1 illustrates SemanTex on an example of article about the correlation
of ca eine consumption, risk of Parkinson's disease and the related di erences
between men and women. When exploring the concept `high ca eine consumption',
one can continue to the `hormones' and `women' nodes. Expanding the `women'
link shows many concepts related to women's health, such as `oophorectomy'
(removal of ovaries). There is a single article related to that concept, dealing with
increased risk of parkinsonism in women who underwent oophorectomy before
menopause. This shows how one can quickly explore a problem from many
different viewpoints with SemanTex, linking an article dealing with the in uence of
particular hormonal levels on the development of Parkinson's Disease in women
with another article looking into higher risk of parkinsonism due to lower levels
of estrogen caused by the pre-menopausal removal of ovaries.</p>
      <p>When further exploring some articles related to the last one, one can see all
the paths that connect them. For instance, a study about Dutch elderly people is
linked to the oophorectomy article by means of four paths, all involving concepts
clearly related to common geriatric ailments. This illustrates the possibility of
smooth topical progression in exploring the articles.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>In this work, we have presented SemanTex, an application that discovers
implicit, semantically annotated links within a corpus of textual resources. We
have implemented a sample prototype of the technology deployed on PubMed
articles using the standard PubMed look-and-feel. This was to show how we can
easily add value to many traditional applications involving exploration of large
numbers of textual resources. In a similar way, we will implement SemanTex
versions for New York Times and Wikipedia articles within an evaluation trial of
the technology. Last but not least, we plan to generate RDF representations of
the semantically annotated links between texts computed by particular instances
of SemanTex and expose them as a part of the LOD cloud.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raghavan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Schutze, H.: Introduction to Information Retrieval. Cambridge University Press (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wilbur</surname>
            ,
            <given-names>W.J.:</given-names>
          </string-name>
          <article-title>PubMed related articles: a probabilistic topic-based model for content similarity</article-title>
          .
          <source>BMC Bioinformatics</source>
          <volume>8</volume>
          (
          <issue>1</issue>
          ) (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Grefenstette</surname>
          </string-name>
          , E.:
          <article-title>Analysing document similarity measures</article-title>
          .
          <source>Master's thesis</source>
          , University of Oxford (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Novacek</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burns</surname>
            ,
            <given-names>G.A.</given-names>
          </string-name>
          :
          <article-title>SKIMMR: Facilitating knowledge discovery in life sciences by machine-aided skim reading</article-title>
          .
          <source>PeerJ</source>
          (
          <year>2014</year>
          ) In press, see https://peerj. com/preprints/352/ for a preprint.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>