<!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>A Relation Extraction Approach for Clinical Decision Support</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Maristella Agosti</string-name>
          <email>maristella.agosti@unipd.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giorgio Maria Di Nunzio</string-name>
          <email>gianmaria.silvello@unipd.it</email>
          <email>giorgiomaria.dinunzio@unipd.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Department of Information Engineering</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Gianmaria Silvello</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Stefano Marchesin</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Padua, Italy</institution>
          ,
          <addr-line>Via Giovanni Gradenigo, 6/b</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <abstract>
        <p>In this paper, we investigate how semantic relations between concepts extracted from medical documents can be employed to improve the retrieval of medical literature. Semantic relations explicitly represent relatedness between concepts and carry high informative power that can be leveraged to improve the e ectiveness of retrieval functionalities of clinical decision support systems. We present preliminary results and show how relations are able to provide a sizable increase of the precision for several topics, albeit having no impact on others. We then discuss some future directions to minimize the impact of negative results while maximizing the impact of good results.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The volume of medical literature published every year
keeps growing at a very fast pace. The time required
by clinicians to retrieve relevant information from such
an amount of literature using standard systems is often
prohibitive. Therefore, there has been a strong
interest in Clinical Decision Support (CDS) systems [Ber07]
designed to produce e ective and timely information
that can help clinicians in the decision making process
for patient care. Within this context, we focus on
casebased retrieval | i.e. given a medical case of interest,
the CDS system should retrieve highly related medical
Copyright © CIKM 2018 for the individual papers by the papers'
authors. Copyright © CIKM 2018 for the volume as a collection
by its editors. This volume and its papers are published under
Semantic relations are a key aspect within the
semantics of a document. They have been mainly used to
nd relevant concepts to expand a user query, but not
as semantic elements to be indexed and retrieved. We
hypothesize semantic relations can provide a higher
semantic representation of medical cases and literature.</p>
      <p>In this work, we present an initial study on the
effectiveness of the use of semantic relations for the
retrieval of medical literature. We de ne an approach
comprising two methods: a rule-based method and a
learning method. In the rule-based method, we assign
a relation to a pair of concepts | contained within
the same sentence | when it holds within a reference
KB. In the learning method, we train a sentence-level
relation extractor that is able to infer relation between
a pair of concepts given the sentence's context.</p>
      <p>We evaluated our approach by using the publicly
shared OHSUMED collection [HBLH94]. OHSUMED
provides rather short queries which represent a hard
task for our approach, since limited information | e.g.
concepts and relations | can be extracted from them.
Testing with OHSUMED allow us to assess the
potential and limitations of the approach. The remainder of
the paper is organized as follows: Section 2 presents
the background and related work, Section 3 describes
the proposed approach, Section 4 presents experiments
and results and Section 5 draws some conclusions and
outlines future work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>Concept-based IR aims at making use of external
sources (like thesauri and ontologies) to provide
additional knowledge and context that may not be explicit
in a document collection and users' queries.
Conceptbased methods can be categorized in two types: (i)
methods that use concepts in both indexing and
retrieval stages [EMG11], and (ii) methods that apply
concept analysis in one speci c stage, such as
conceptbased query expansion [GVDW06]. The approach we
adopt extends the use of concepts to relations and uses
them in all stages of retrieval. This is more
challenging, but it allows for a ner semantic representation of
documents and queries.</p>
      <p>In the biomedical domain | where there are
authoritative and curated ontologies | concept-based
approaches demonstrate consistent improvements over
classic keyword-based systems. In [KZN+12], `is-a'
relationships between concepts are used to weight
documents containing concepts subsumed by the query's
concepts. [LMO13b] proposes a method to represent
medical records and queries by focusing only on
medical concepts essential for the information need of a
medical search task. In [LMO13a], queries are
expanded by inferring additional conceptual
relationships from domain-speci c resources as well as by
extracting informative concepts from the top-ranked
medical records.</p>
      <p>The eld of Biomedical Information Extraction
(BioIE) is highly relevant for CDS. [LCJY16] reviews
the recent advances in learning-based approaches for
BioIE tasks. BioIE tasks comprise entity linking
[ZHZ+15], event identi cation [APTK10] and relation
extraction [USSD11, WF14]. Being targeted to CDS
| i.e. voted to the extraction of key relations that
can facilitate clinical decision making | our problem
setup is fundamentally di erent from the conventional
biomedical setups. Most of state-of-the-art biomedical
relation extraction techniques are developed for
speci c relations, like protein-protein interactions,
genedisease interactions and so on | which cover only a
fraction of the biomedical domain.</p>
      <p>Regarding relations in IR, [VMdR17] study the
problem of nding human readable descriptions of a
given relationship in a knowledge graph. [SRPD16]
apply supervised relation extraction to documents that
are relevant for an information need Q and study how
many of the extracted relations are indeed relevant for
Q. [KD17] explores current state of the art in
unsupervised relation extraction (OpenIE) for the task of
nding support passages to complement an entity ranking
with human-readable explanations of how those
retrieved entities are connected to the information need.
Conversely, our approach applies supervised relation
extraction to extract semantic relations that are used
in all stages of retrieval. Hence, relations play a pivotal
role in the actual retrieval of documents.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Methodology</title>
      <p>We present a new approach that uses semantic
relations for case-based retrieval. The methodology is
composed of the information extraction step
(Subsection 3.1) and the information retrieval step (Subsection
3.2).
3.1</p>
      <sec id="sec-3-1">
        <title>Information Extraction</title>
        <p>The information extraction step is divided into an
entity linking component and a relation extraction
component.</p>
        <p>The entity linking component extracts entity
mentions within the text and links them to a reference
KB; this reduces the high number of synonyms,
abbreviations and context speci c expressions that are
present in the medical literature. For entity linking we
adopt MetaMap,1 the most authoritative tool to detect
medical entity mentions in free-text. MetaMap
analyses biomedical free-text and identi es concepts
belonging to the Uni ed Medical Language System (UMLS),
associating each mention with a number of concepts
from the UMLS Metathesaurus2 | which comprises
more than 3 million distinct concepts. Within UMLS,
a substantial understanding of the medical domain is
included, comprising medical concepts, relations,
definitions and so on.</p>
        <p>The relation extraction component detects
semantic relation between pairs of concepts within a
sentence. To be consistent with concepts extracted with
MetaMap, we consider semantic relations from UMLS
Metathesaurus as well. Furthermore, since our task
requires a high coverage of the medical domain,
considering UMLS Metathesaurus relations | which are
coarse-grained relationships that span to a high
number of concepts | allows us to increase the recall of
extracted relations.</p>
        <p>1https://metamap.nlm.nih.gov/
2https://www.nlm.nih.gov/research/umls/knowledge_
sources/metathesaurus/</p>
        <p>We de ne two methods for the extraction of
relations from documents and queries: a rule-based
method and a learning method. Rule-based: a
relation is assigned to a pair of concepts if it relates
them within UMLS. We assume that a UMLS relation
between two concepts always occurs, even when it is
not explicitly mentioned in the sentence containing the
two concepts.</p>
        <p>Learning: we train a distantly supervised [MBSJ09]
sentence-level Bidirectional Long Short-Term Memory
(BiLSTM) neural network to detect if a relation
exists between two concepts based on the context of the
sentence. The network architecture is composed of an
input (word embedding) layer of concatenated word
features and positional features. Words are rst
converted into pre-trained word embeddings trained on
26 million abstracts and citations in PubMed |
released by [PGM+13]. Then these word features are
concatenated with two sets of positional features |
to explicitly account for the pairs of words to which
we expect to assign relations [ZLL+14]. We apply
a max-pooling layer right after the bidirectional
recurrent layer and before the output layer | in order
to combine segment-level features that, although not
very strong in representing the entire sentence,
represent local patterns well [ZW15]. In this way, we try
to overcome the tendency of recurrent connections to
forget long-term information too quickly, leading the
supervision at the end of the sentence to be hardly
propagated to early steps in model training (due to
gradient vanishing [BSF94]).
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Information Retrieval</title>
        <p>Documents are indexed by considering all terms as
in the Bag-of-Words (BoW) representation. We
extend the BoW representation to both concepts (BoC)
and relations (BoR) by considering for the indexing
all the extracted concepts and relations respectively.
The ranking is obtained using Okapi BM25 ranking
formula [RW99].</p>
        <p>Since relations are extracted at sentence level, we
also index passages | i.e. groups of consecutive
sentences | by considering all the relations occurring
within each group of sentences (passage-level BoR).
Relevant passages should contain a higher number of
relations related to the information need when
compared to non relevant passages | being more similar
in their semantic contents to the query. Therefore,
documents that contain more relevant passages can be
considered more relevant for the query.</p>
        <p>We de ne a weighting scheme such that a
document score is computed as the weighted sum of its
passages scores, where scores are computed using BM25
as above. The passage-level weighting scheme is as
follows:
score(q; d) =
p2d
X jRp \ Rqj BM 25(p; q)
jRqj
(1)
where d is the document, q is the query, p is a passage
belonging to document d, Rq is the set of relations
extracted from query q and Rp is the set of relations
extracted from passage p.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experiments and Results</title>
      <p>We employed the OHSUMED test collection which
contains 348,566 references from the on-line medical
information database MEDLINE, consisting of titles
and/or abstracts from 270 medical journals over a
veyear period (1987-1991). The available elds are: title,
abstract, MeSH indexing terms, author, source, and
publication type. There are 106 queries in the
collection. Each query is composed of two sentences: title
+ description. Title is the brief summary of the
medical case at hand, description is the information need
required to answer a speci c question for the case.</p>
      <p>Experimental Setup: We performed two
experiments: i) one using the rule-based method to extract
relations out of documents and queries; ii) the other
using the learning method to extract relations out of
documents and queries. We compared the results
obtained applying BM25 to the three representations (i.e.
BoW, BoC and BoR) and we evaluated the results
using the nDCG measure.</p>
      <p>Results: i) The rule-based method was able to
extract relations from a subset of 44 queries. Therefore,
to investigate the e ectiveness of relations, we restrict
the experiments to this subset only | since the
remaining queries lead to no results when considering
relations. Of these 44 queries, only 39 have relations
matching with some documents. Regarding the
relations, we obtained the best results with the
passagelevel approach. We set the passage length to 2, in
order to be compliant with queries' length. Documents'
score was computed using the formula shown above
(1). The nDCG results on these 39 queries are
variable | ranging from 0 (18 cases) to 1 (5 cases), as can
be seen in Figure 1.</p>
      <p>Such a variance gives us some hints about the
informative power of relations. When properly extracted,
relations can be highly e ective, indeed, we compared
the average nDCG values of concepts and relations on
only those topics where relations give a result di
erent than 0 and we found a statistically signi cant
average improvement of 20%. A t-test was performed to
validate the improvement. Regarding the comparison
between relations and terms, the behavior of relations
is similar to the one of terms (baseline approach), and</p>
    </sec>
    <sec id="sec-5">
      <title>Discussion</title>
      <p>In this work, we proposed and evaluated the e
ectiveness of semantic relations as basic constituents for a
CDS system. We de ned two methods for extracting
relations from queries and documents: a rule-based
method and a learning method. We found that
relations | when pertinent to the initial information
need | are highly valuable, outperforming concepts.
The challenge lies in how to limit those cases where
relations provide no relevant results for the
information need. To this end, considering collections where
queries present a long and narrative structure (e.g.
TREC CDS tracks) might be a possible direction to
balance such issue. Furthermore, de ning more
IRoriented relation extraction algorithms that are
capable of overcoming the high precision-low recall nature
of state-of-the-art methods is a direction we will
investigate.
[BDS+04]</p>
      <sec id="sec-5-1">
        <title>D. T. Burke, M. C. DeVito, J. C. Schneider, S. Julien, and A. L. Judelson. Reading habits of physical medicine and rehabilitation resident physicians. American</title>
        <p>Journal of Physical Medicine &amp;
Rehabilitation, 83(7):551{559, 2004.</p>
        <p>E. S. Berner. Clinical decision support
systems, volume 233. Springer, 2007.</p>
      </sec>
      <sec id="sec-5-2">
        <title>Y. Bengio, P. Simard, and P. Frasconi.</title>
        <p>Learning long-term dependencies with
gradient descent is di cult. IEEE
Transactions on Neural Networks, 5(2):157{
166, 1994.</p>
      </sec>
      <sec id="sec-5-3">
        <title>O. Egozi, S. Markovitch, and</title>
        <p>E. Gabrilovich. Concept-based
information retrieval using explicit semantic
analysis. ACM Trans. Inf. Syst.,
29(2):8:1{8:34, April 2011.</p>
      </sec>
      <sec id="sec-5-4">
        <title>W. Hersh, C. Buckley, T.J. Leone, and</title>
        <p>D. Hickam. Ohsumed: an interactive
retrieval evaluation and new large test
collection for research. In SIGIR'94, pages
192{201. Springer, 1994.</p>
      </sec>
      <sec id="sec-5-5">
        <title>A. Kadry and L. Dietz. Open relation</title>
        <p>extraction for support passage retrieval:
Merit and open issues. In Proceedings of
the 40th International ACM SIGIR
Conference on Research and Development in
Information Retrieval, pages 1149{1152.</p>
        <p>ACM, 2017.
[LCJY16]
[MBSJ09]</p>
      </sec>
      <sec id="sec-5-6">
        <title>M. Mintz, S. Bills, R. Snow, and D. Juraf</title>
        <p>sky. Distant supervision for relation
extraction without labeled data. In
Proceedings of the Joint Conference of the 47th
Annual Meeting of the ACL and the 4th
International Joint Conference on
Natural Language Processing of the AFNLP:
Volume 2-Volume 2, pages 1003{1011.
Association for Computational Linguistics,
2009.
[PGM+13] S. Pyysalo, F. Ginter, H. Moen,
T. Salakoski, and S. Ananiadou.
Distributional semantics resources for biomedical
text processing. In Proceedings of the 5th
International Symposium on Languages
in Biology and Medicine, Tokyo, Japan,
pages 39{43, 2013.
[RW99]
[SRPD16]
[USSD11]</p>
      </sec>
      <sec id="sec-5-7">
        <title>S. E. Robertson and S. Walker. Okapi/keenbow at trec-8. In TREC, volume 8, pages 151{162. Citeseer, 1999.</title>
      </sec>
      <sec id="sec-5-8">
        <title>M. Schuhmacher, B. Roth, S. P. Ponzetto,</title>
        <p>and L. Dietz. Finding relevant relations in
relevant documents. In European
Conference on Information Retrieval, pages 654{
660. Springer, 2016.</p>
        <p>O zlem Uzuner, Brett R South, Shuying
Shen, and Scott L DuVall. 2010 i2b2/va
challenge on concepts, assertions, and
relations in clinical text. Journal of the
American Medical Informatics
Association, 18(5):552{556, 2011.
[VMdR17] N. Voskarides, E. Meij, and M. de
Rijke. Generating descriptions of entity
[GVDW06] F. A. Grootjen and T. P. Van Der Weide.</p>
        <p>Conceptual query expansion. Data &amp;
Knowledge Engineering, 56(2):174{193,
2006.
[KZN+12] B. Koopman, G. Zuccon, A. Nguyen,
D. Vickers, L. Butt, and P. D. Bruza.</p>
        <p>Exploiting snomed ct concepts and
relationships for clinical information retrieval:
Australian e-health research centre and
queensland university of technology at the
trec 2012 medical track. In The
TwentyFirst Text REtrieval Conference
Proceedings (TREC 2012)[NIST Special
Publication: SP 500-298], pages 1{8, 2012.
[WF14]
[ZHZ+15]
[ZLL+14]
[ZW15]</p>
      </sec>
      <sec id="sec-5-9">
        <title>C. Wang and J. Fan. Medical relation ex</title>
        <p>traction with manifold models. In
Proceedings of the 52nd Annual Meeting of
the Association for Computational
Linguistics (Volume 1: Long Papers),
volume 1, pages 828{838, 2014.</p>
      </sec>
      <sec id="sec-5-10">
        <title>J. Zheng, D. Howsmon, B. Zhang,</title>
        <p>J. Hahn, D. McGuinness, J. Hendler, and
H. Ji. Entity linking for biomedical
literature. BMC Medical Informatics and
Decision Making, 15(1):S4, 2015.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [APTK10]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ananiadou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pyysalo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tsujii</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D. B</given-names>
            <surname>Kell</surname>
          </string-name>
          .
          <article-title>Event extraction for systems biology by text mining the literature</article-title>
          .
          <source>Trends in Biotechnology</source>
          ,
          <volume>28</volume>
          (
          <issue>7</issue>
          ):
          <volume>381</volume>
          {
          <fpage>390</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>F.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jagannatha</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Yu</surname>
          </string-name>
          .
          <article-title>Learning for biomedical information extraction: methodological review of recent advances</article-title>
          .
          <source>arXiv preprint arXiv:1606.07993</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [LMO13a]
          <string-name>
            <given-names>N.</given-names>
            <surname>Limsopatham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Macdonald</surname>
          </string-name>
          ,
          <string-name>
            <surname>and I. Ounis.</surname>
          </string-name>
          <article-title>Inferring conceptual relationships to improve medical records search</article-title>
          .
          <source>In Proceedings of the 10th Conference on Open Research Areas in Information Retrieval</source>
          , pages
          <fpage>1</fpage>
          <issue>{8</issue>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [LMO13b]
          <string-name>
            <given-names>N.</given-names>
            <surname>Limsopatham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Macdonald</surname>
          </string-name>
          ,
          <string-name>
            <surname>and I. Ounis.</surname>
          </string-name>
          <article-title>A task-speci c query and document representation for medical records search</article-title>
          .
          <source>In European Conference on Information Retrieval</source>
          , pages
          <volume>747</volume>
          {
          <fpage>751</fpage>
          . Springer,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>D.</given-names>
            <surname>Zeng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Zhou</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          .
          <article-title>Relation classi cation via convolutional deep neural network</article-title>
          .
          <source>In Proceedings of COLING</source>
          <year>2014</year>
          ,
          <source>the 25th International Conference on Computational Linguistics: Technical Papers</source>
          , pages
          <volume>2335</volume>
          {
          <fpage>2344</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhang</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Relation classi - cation via recurrent neural network</article-title>
          .
          <source>arXiv preprint arXiv:1508.01006</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>