<!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>MayoNLPTeam at the 2016 CLEF eHealth Information Retrieval Task 1</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yanshan Wang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Stephen Wu</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hongfang Liu</string-name>
          <email>Liu.Hongfangg@mayo.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Health Sciences Research, Mayo Clinic</institution>
          ,
          <addr-line>Rochester, Minnesota</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Medical Informatics &amp; Clinical Epidemiology, Oregon Health and Science University</institution>
          ,
          <addr-line>Portland, Oregon</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Wang.Yanshan</institution>
          ,
          <addr-line>Liu.Hongfang</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper presents the participation of MayoNLPTeam in the 2016 CLEF eHealth Information Retrieval Task (IR Task 1: ad-hoc search). We explored a Part-of-Speech (POS) based query term weighting approach which assigns di erent weights to the query terms according to their POS categories. The weights are learned by de ning an objective function based on the mean average precision. We applied the proposed approach with the optimal weights obtained from TREC 2011 and 2012 Medical Records Track into the Query Likelihood model (Run 2) and Markov Random Field (MRF) models (Run 3). The conventional Query Likelihood model was implemented as the baseline (Run 1).</p>
      </abstract>
      <kwd-group>
        <kwd>information retrieval</kwd>
        <kwd>Part-of-Speech</kwd>
        <kwd>language model</kwd>
        <kwd>Markov Random Field model</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The amount of health information on the web has increased tremendously during
the last decades. People access these contents to nd information or answers
regarding their health concerns. According to a late 2013 survey by the Pew
Research Center's Internet and American Life Project, 85% of US adults use
the Internet and 72% of them have looked for health information online [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
However, it is di cult to nd the information related precisely to their concerns.
To tackle this issue, the 2016 CLEF eHealth Information Retrieval (IR) Task
1 [
        <xref ref-type="bibr" rid="ref3">3,13</xref>
        ] focuses on the retrieval of health contents on the web for the health
queries generated by exploring real consumer posts from health forums. The
goal of this task is to explore possible IR systems that people could use to
search for information or answers to their health questions instead of posting
those questions on health forums and waiting for answers.
      </p>
      <p>
        As a participant in IR Task 1, we introduce a Part-of-Speech (POS) based
query term weighting approach. The POS property re ects whether the term is
informative or not. Intuitively, a noun is more informative than a preposition,
and in the medical domain a proper noun is more important than a noun to
understand semantics of a query. Therefore, we hypothesize that leveraging POS
information to weight the query terms would improve the performance of IR
systems. The experiments on the Electric Health Records (EHRs) retrieval
provided by the Text REtrieval Conference (TREC) 2011 and 2012 Medical Records
tracks [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] have veri ed our hypothesis. We would like to examine whether this
approach is viable for the internet health contents retrieval.
      </p>
      <p>
        We submitted three o cial runs to CLEF eHealth. In Run 1, we utilized plain
text of the test topics as the input queries and the Query Likelihood model with
Dirichlet smoothing [11] as the retrieval model. This run was served as a baseline.
In Run 2, we utilized the POS-based query term weighting method to improve
the Query Likelihood model. Di erent from Run 2 where we assumed that the
terms were independent, Run 3 applied Markov Random Field (MRF) model [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]
and incorporated the POS-based query term weighting method.
      </p>
      <p>The rest of this paper is organized as follows. Section 2 describes the dataset
and queries of the 2016 CLEF eHealth IR Task. Section 3 presents the our
framework in detail including the system details and how we trained the weights.
The experiments and experimental results are shown in Section 4. Section 5
concludes our study.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Dataset and Queries of CLEF eHealth IR Task 1</title>
      <p>The ClueWeb12 B13 dataset is used in the 2016 CLEF eHealth IR Task. This
dataset is a small portion of the crawled web documents in ClueWeb12 dataset
as part of the lemur project1. It contains over 52 million documents. Those web
documents in this corpus include health and non-health contents. Each document
includes a title eld in the \WARC- TREC-ID" eld of the document's WARC
header and a title and a heading eld. The goal of this challenge is to nd those
relevant health contents given an input query.</p>
      <p>The queries provided by the task are extracted from the posts in the askDocs
health web forum2. Therefore, this set of queries re ects the real information
needs of health consumers. Each of six query creators with di erent medical
expertise was given 50 initial posts from the forum to generate the queries with
a total of 300 queries created. Each query has an id eld and a title eld. The id
eld is used to distinguish the queries while the title eld represents the queries.
Task 1 of the challenge requires us to treat each query individually and submit
up to 3 ranked runs with up to 1000 documents per query.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Method</title>
      <p>In this section, we present the IR system and the proposed approach, and then
detail the submitted runs.</p>
      <sec id="sec-3-1">
        <title>1 http://lemurproject.org/</title>
      </sec>
      <sec id="sec-3-2">
        <title>2 https://www.reddit.com/r/AskDocs/</title>
        <p>3.1</p>
        <sec id="sec-3-2-1">
          <title>System Overview</title>
          <p>In our previous submission of the 2013 ShARe/CLEF eHealth Evaluation Lab
[12], we focused on semantiIcnstroadnudctiuontilized multiple external sources, such as
Mayo Clinic clinical notes collection and the Uni ed Medical Language System
Objectives
the POS pwrhoicpheisrtkynotwon aassEsilegcntrodniic HeeraeltnhtRweceoirdg h(EtHsRt)osyqstuemer.y terms.
(UMLS)¦,f Colriniqcaulerercyoredxspanadnhseioalnth.inTfohr misatyioenaarrewsetofreodcuinsdimgitoalrfeoromn, syntac¦ti Pcsroaponsde alePvOeSrawgeeighted MRF model for clinical information
retrieval, POS-MRF, to improve clinical notes retrieval accurac
organizersbfyoGroldtehnSeecttiaonsLkin.e TSeharceh Adlgaortitahms)e, tandaµnj+1d st0.3 andard indexes were available in the</p>
          <p>=µj +yjdj. If j&lt;τ,replace j by j+1,and repeat Step1. 0.2
Azure instOathnecrweis.e, Sif pj=τe, cgoi tocSatelply2., the preproces0.2s5ing included stopwords removal and</p>
          <p>0.2 0.15
Krovetz Øs t2e: mLemtλk+i1n=gµτ.+1.ITf||λhk+e1−nλk||t&lt;hε,ethetnitsltoep. and heading elds were indexed using Indri
rOetpheearwtSistee,ple1t.µ1 =λk+1, let j=1,replace k byk+1, and 0.15 0.1</p>
          <p>Experimental Results
¦  Data
Ø  TREC 2011 &amp; 2012 Medical</p>
          <p>Records Track
¦  Measures
Ø  Mean Average Precision</p>
          <p>(MAP)
0.3
0.05
Ø  3: return λ’s.</p>
          <p>0.1
0.05</p>
          <p>Acknowledgements</p>
          <p>This study is supported by grant 1R01LM011934-01A1 from the National Institute of Health.</p>
          <p>
            The POS categories for queries were obtained using Apache cTAKES 3, an
open source software package. The POS model in Apache cTAKES was derived
using multiple POS annotated corpora including a corpus of a collection of
clinical notes, GENIA corpus [
            <xref ref-type="bibr" rid="ref9">9</xref>
            ] and Penn Treebank [
            <xref ref-type="bibr" rid="ref4">4</xref>
            ], and thus favorable for
medical text annotation.
In this subsection, we describe the POS-based query term weighting approach
and how the Indri queries are generated.
          </p>
          <p>Given the bag-of-words assumption, the conventional Query Likelihood model
ranks the documents according to the following ranking function:
r(Q; D) = X f (qi; D);</p>
          <p>
            qi
where Q represents the query, D the document, qi the ith query term, and
f (qi; D) the potential function over qi and D. f (qi; D) could be de ned by
various methods, such as tf-idf [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ], BM25 [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ], Jelinck-Mercer method [
            <xref ref-type="bibr" rid="ref2">2</xref>
            ], or Dirichlet
smoothing method [11]. The conventional Query Likelihood model treats each
query term equally. However, in the medical domain we observe that the query
terms are not always equally important. For example, in the query Alzheimer's
disease, the term Alzheimer is more important and speci c than disease to
understand the query semantics where the semantics can be partially inferred from
syntactics. As in the previous example, Alzheimer is a proper noun and disease
is a noun. The observation motivates us to assign di erent weights to query
terms according to the POS categories. By doing so, the ranking function can
be written as:
r(Q; D) = q1 f (q1; D) + q2 f (q2; D) +
+ qn f (qn; D);
(2)
where qi is the weight corresponding to the POS category of query term qi.
          </p>
          <p>
            Beyond the bag-of-words assumption, the MRF model considers the relations
between terms by using the Markov property [
            <xref ref-type="bibr" rid="ref5">5</xref>
            ]. The ranking function is de ned
as:
r(Q; D) = X f (c; qi; D) + X f (c; qi; D) + X f (c; qi; D);
          </p>
          <p>c2T c2O c2U
where c is the clique set, qi is the ith query term in that clique, and T , O, U
denote dependency types full independence, sequential dependence, full
dependence, respectively. We can incorporate the POS-based query term weighting
approach and de ne the new ranking function as:</p>
          <p>( ( )
r(Q; D) = X</p>
          <p>)</p>
          <p>X qi f (c; qi; D) + X
c2T</p>
          <p>qi
+ X
c2U
(
c2O</p>
          <p>)
X qi f (c; qi; D) :
qi</p>
        </sec>
      </sec>
      <sec id="sec-3-3">
        <title>3 http://ctakes.apache.org/</title>
        <p>X qi f (c; qi; D)
qi
(1)
(3)
(4)
3.4</p>
        <sec id="sec-3-3-1">
          <title>Weight Training</title>
          <p>The weights can be trained by de ning an objective function based on retrieval
performance metrics, e.g., mean average precision (MAP). Our goal is to
maximize the performance metrics. Since there are over 30 POS categories according
to the Penn Treebank Project 4, this is a multidimensional optimization problem.</p>
          <p>
            We adopted MAP as the performance metric for weight training and
considered seven POS categories: (singular or mass nouns (NN), plural nouns (NNS),
past participle verbs (VBN), past tense verbs (VBD), adjectives (JJ), adverbs
(RB), singular proper nouns (NNP)) and marked all other categories as others.
Then we utilized a cyclic coordinate method to solve this optimization problem.
The dataset of the TREC 2011 and 2012 Medical Records tracks [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ] was used
to train the weights. It contained over 93 thousand de-identi ed clinical reports
and 34 test queries for the TREC 2011 and 47 for the TREC 2012. We rst
trained on the TREC 2011 data and tested on the TREC 2012 data, and then
trained on the TREC 2012 data and tested on the TREC 2011 data. Finally the
average weight for each POS category was used to generate the Indri queries for
the 2016 CLEF eHealth IR Task.
4
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experiments and Results</title>
      <sec id="sec-4-1">
        <title>4 https://www.cis.upenn.edu/ treebank/</title>
        <p>In this paper we presents our participation to the 2016 CLEF eHealth
Information Retrieval Task 1. We explored a Part-of-Speech (POS) based query term
weighting approach which assigns di erent weights to the query terms according
to their POS categories. In the future work, we would like to explore how to
utilize the external resources for query expansion in the proposed method.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>The authors gratefully acknowledge the support from the National Library of
Medicine (NLM) grant R01LM11934.
11. Zhai, C., La erty, J.: A study of smoothing methods for language models applied
to ad hoc information retrieval. In: Proceedings of the 24th annual international
ACM SIGIR conference on Research and development in information retrieval. pp.
334{342. ACM (2001)
12. Zhu, D., Wu, S.T.I., Masanz, J.J., Carterette, B., Liu, H.: Using discharge
summaries to improve information retrieval in clinical domain. In: Proceedings of the
ShARe/CLEF eHealth Evaluation Lab (2013)
13. Zuccon, G., Palotti, J., Goeuriot, L., Kelly, L., Lupu, M., Pecina, P., Mueller,
H., Budaher, J., Deacon, A.: The ir task at the clef ehealth evaluation lab 2016:
User-centred health information retrieval. In: CLEF 2016 Evaluation Labs and
Workshop: Online Working Notes. CEUR-WS (2016)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Pew</given-names>
            <surname>Internet</surname>
          </string-name>
          and American Life Project:
          <article-title>Health Fact Sheet</article-title>
          .
          <source>Tech. rep.</source>
          , Pew Research Center (
          <year>2013</year>
          ), http://www.pewinternet.org/fact-sheets/ health-fact-sheet/
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Jelinek</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Interpolated estimation of markov source parameters from sparse data. Pattern recognition in practice pp</article-title>
          .
          <volume>381</volume>
          {
          <issue>402</issue>
          (
          <year>1980</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Kelly</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goeuriot</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Suominen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nvol</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palotti</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zuccon</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Overview of the clef ehealth evaluation lab 2016</article-title>
          .
          <article-title>clef 2016 - 7th conference and labs of the evaluation forum</article-title>
          .
          <source>In: Lecture Notes in Computer Science (LNCS)</source>
          . Springer (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Marcus</surname>
            ,
            <given-names>M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marcinkiewicz</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Santorini</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Building a large annotated corpus of english: The penn treebank</article-title>
          .
          <source>Computational linguistics 19(2)</source>
          ,
          <volume>313</volume>
          {
          <fpage>330</fpage>
          (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Metzler</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Croft</surname>
          </string-name>
          , W.B.:
          <article-title>A Markov random eld model for term dependencies</article-title>
          .
          <source>In: Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval</source>
          . pp.
          <volume>472</volume>
          {
          <fpage>479</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Robertson</surname>
            ,
            <given-names>S.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Walker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jones</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hancock-Beaulieu</surname>
            ,
            <given-names>M.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gatford</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , et al.:
          <article-title>Okapi at trec-3</article-title>
          . NIST SPECIAL PUBLICATION SP pp.
          <volume>109</volume>
          {
          <issue>109</issue>
          (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Salton</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McGill</surname>
            ,
            <given-names>M.J.</given-names>
          </string-name>
          :
          <article-title>Introduction to modern information retrieval</article-title>
          .
          <source>McGrawHill</source>
          ,
          <string-name>
            <surname>Inc.</surname>
          </string-name>
          (
          <year>1986</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Strohman</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Metzler</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Turtle</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Croft</surname>
          </string-name>
          , W.B.:
          <article-title>Indri: A language model-based search engine for complex queries</article-title>
          .
          <source>In: Proceedings of the International Conference on Intelligent Analysis</source>
          .
          <source>vol. 2</source>
          , pp.
          <volume>2</volume>
          {
          <issue>6</issue>
          .
          <string-name>
            <surname>Citeseer</surname>
          </string-name>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Tsuruoka</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tateishi</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>J.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ohta</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McNaught</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ananiadou</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsujii</surname>
          </string-name>
          , J.:
          <article-title>Developing a robust part-of-speech tagger for biomedical text</article-title>
          . Advances in informatics pp.
          <volume>382</volume>
          {
          <issue>392</issue>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Voorhees</surname>
            ,
            <given-names>E.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hersh</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Overview of the trec 2012 medical records track</article-title>
          .
          <source>In: The Twenty- rst Text REtrieval Conference proceedings (TREC)</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>