<!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>Relevance Model Augmented with Inter-Collection Co-occurrence Statistics for Ad-hoc Retrieval in Precision Medicine</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Sonal Mishra</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Procheta Sen</string-name>
          <email>P@5</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Debasis Ganguly</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Prasenjit Majumder</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dhirubhai Ambani Institute of Information and Communication and Technology</institution>
          ,
          <addr-line>Gandhinagar</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Glasgow</institution>
          ,
          <addr-line>Glasgow</addr-line>
          ,
          <country country="UK">United Kingdom</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>1901</year>
      </pub-date>
      <abstract>
        <p>The ubiquitous growth of the volume of medical literature has necessitated the use of search systems to retrieve the relevant literature from a large collection of medical documents. Such a retrieval based approach has been shown to be useful in the precision medicine task, where instead of keyword-based queries of ad-hoc IR, the queries comprise of a disease name and the personal context associated with the disease, e.g., the gene sequence of the person or their demographics. The two fundamental sources of information useful for the precision medicine task are the medical literature (e.g. PubMed articles) and randomized control trials (RCTs). In this paper, we propose a symbiotic relevance feedback model that is able to utilize the information not only individually from each collection, but is also able to operate across collections improving the retrieval efectiveness of each collection by leveraging information from the top-retrieved documents of the other. Our experiments on the TREC 2019 and 2020 precision medicine track show that our proposed symbiotic relevance feedback model outperforms post-hoc combinations of standard relevance feedback models operating independently on respective collections.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Relevance feedback</kwd>
        <kwd>Smoothing across collections</kwd>
        <kwd>Precision Medicine</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Accessing relevant information from medical literature or clinical trials is beneficial for the
task of precision medicine, where given the disease and a particular genetic variant of a patient,
the task is to find information that is relevant (e.g., medicines, treatments - what works and what
not) in the context of the specified gene variant [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ]. A major diference of ‘precision medicine
information retrieval’ (PMIR) with respect to ad-hoc search over news or web documents is
that the query terms corresponding to the disease and the gene represent two diferent aspects
of information need, the information retrieved for each of which then needs to be collated in an
efective manner.
      </p>
      <p>
        Existing approaches in PMIR [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] has reported that the use of external collections or knowledge
bases contribute to enrich the information needs in an efective manner with the use of synonyms
and other related concepts. These enriched information needs eventually help improve the
retrieval quality, because it is usually the case that the same concept is represented by the
choice of diferent words across diferent documents. In fact, the best performing system of the
TREC Precision Medicine track of 2019 made use of a domain-specific thesaurus 3 to expand
gene variant names with additional information, such as aliases of the gene name. For instance,
the term ‘BRAF’ may be expanded with additional terms such as ‘B-RAF1’, ‘NS7’, ‘RAFB1’ etc.,
which potentially contributes in bridging the vocabulary gap across retrieved documents.
      </p>
      <p>
        A limitation of using external resources is that such resources may not be available for all
application domains. Instead, in this paper, we propose a pseudo-relevance feedback (PRF)
based approach which does not need to rely on the existence of external resources for efective
retrieval. While PRF is a classic IR technique that has proven, over the years, to be efective
in improving the overall retrieval efectiveness [
        <xref ref-type="bibr" rid="ref5 ref6 ref7 ref8">5, 6, 7, 8</xref>
        ], a straight-forward application of
an existing PRF algorithm is less likely to be efective for PMIR. This is because in contrast
to standard IR test collections comprised of documents from a single genre (e.g., web articles
or news), the test collection for PMIR essentially comprises of documents from two diferent
sources, namely the medical literature and the clinical trials, that are characteristically diferent
from one another. While the former constitutes peer reviewed scientific articles, structured in a
consistently formal manner and backed by empirical findings, the latter, in turn, reports initial
ifndings of ongoing randomized control trials (RCTs) or even publishes eligibility criteria of
upcoming RCTs.
      </p>
      <p>In this paper, we propose a novel PRF solution that addresses this characteristically unique
situation of retrieving from two diferent genres of document collections in PMIR. The proposed
approach seeks to model the semantic relationship of terms both within and across the two
collections, thus complementing each other, to improve the overall retrieval quality.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Pseudo-relevance feedback (PRF). PRF essentially relies on term level manipulations, e.g.,
while Ogilvie et. al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] learn the appropriate number of feedback terms for query expansion, Cao
et. al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] selectively use good feedback terms for query expansion. Traditional PRF methods,
such as Okapi [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], the relevance model (RM) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and its variants [
        <xref ref-type="bibr" rid="ref12 ref13 ref6">6, 12, 13</xref>
        ], primarily rely
on the set of top-retrieved documents for selecting candidate expansion terms. For term-level
      </p>
      <sec id="sec-2-1">
        <title>3https://www.ncbi.nlm.nih.gov/gene</title>
        <p>
          manipulations, researchers have also leveraged on semantic matching with embedded vectors
to learn retrieval-specific semantic relationships from top documents retrieved with a large
number of queries from a query log [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], or to combine the efects of global term semantics
within the framework of RM [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
        </p>
        <p>
          In a recent work, Lu et al. [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] explored diferent fusion techniques to combine multiple
relevance models estimated on diferent query variants. A dual cross-media relevance model
for image annotation was proposed by [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] which estimates the joint probability of image
and annotation words. The study in [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] proposed a positional relevance model (PRM) which
preferentially weighs the term co-occurrence relations with the positional information of words.
        </p>
        <p>
          A cross-lingual extension of RLM was proposed in [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], where given a query in the source
language, the corresponding topic model was estimated in the target language with the help of
dictionary-based word alignment. It was shown by [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] that the estimation of relevance models
can be improved by using large external corpora. The results reported in [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] showed that
using external corpus was 10% more efective in terms of mean average precision compared to
standard relevance language model [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
        <p>
          The diference of our proposed cross relevance language model with existing modifications
of relevance language model is that rather than using extra information from external corpus
[
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] or parallel corpora [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] or the position information of the words in documents [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] we
exploit the diferent types of document structure within a corpus to improve the efectiveness
of the relevance models.
        </p>
        <p>
          Precision Medicine Retrieval. Wang and Akella [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] used a concept based relevance
language model, where the documents and queries are transformed from the term space into
concept space to capture the semantic relations between diferent biomedical terms. Agosti
et al. [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] investigated the efect of diferent query formulation techniques for the TREC
precision medicine task. The study in [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] proposed the use of knowledge graphs for explainable
biomedical document retrieval using neural models. An online system to experiment with
diferent gene based query expansion techniques in the TREC precision medicine track setup
was developed by [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ]. Domain knowledge extracted from external corpus has been shown
to improve retrieval efectiveness of biomedical documents [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. While [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] investigated the
efect of diferent tokenization techniques in biomedical document retrieval, [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ] proposed a
learning to rank framework for biomedical document retrieval. An explanation framework for
biomedical document retrieval was proposed in [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ] with an objective to capture the diferent
aspects of relevance.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Cross Relevance Model (CRM)</title>
      <p>Although we apply the proposed cross relevance model for the PMIR task, which involves two
independent collections, we present our model in a generic manner, i.e., we assume that the
task is to retrieve documents from  diferent collections and then collate them into a single
ranked list.</p>
      <p>
        Relevance Model (RLM). We start with a brief technical introduction to the relevance model
(RLM) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. RLM essentially estimates a probability distribution of term weights based on the
co-occurrence likelihoods. These co-occurrences are computed between the query terms and
the ones present in the top-retrieved documents. Formally speaking, the weight of a term  in
the RLM distribution computed for a given query  is
 (|) =
      </p>
      <p>
        ∑︁
∈()
 (|) ∏︁  (|),
∈
(1)
where  is the set of top- ranked documents retrieved for  with an initial retrieval model,
e.g. BM25 [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>Inter-collection RLM. We now generalize the notion of RLM to span across diferent
collections, as required in PMIR. In general, denoting the set of  ∈ N documents collections as

 = ∪=1{}, for a given query , we first retrieve  diferent ranked lists, one for each 
by a retrieval model such as BM25. Let the ranked list of top- documents retrieved from the
collection  be denoted by (, ).</p>
      <p>Our objective now is to model the term dependence relationships between the terms of a
collection  with respect to the ones that are outside the collection, i.e.,  − . Towards that
objective, we generalize the RLM distribution of 1 as
 (|, ) = 
∈(,)
∑︁  (|) ∏︁  (|) + (1 −  )</p>
      <p>∈
⏟</p>
      <p>⏞
RLM for</p>
      <p>∑︁
∈(,− )
⏟
 (|) ∏︁  (|) . (2)</p>
      <p>∈
RLM for ⏞−</p>
      <p>
        In Equation 2, we see that the term distribution weights are now a linear combination of the
term co-occurrence likelihoods within the current collection , and also those in the set of
all collections external to . The parameter  ∈ [
        <xref ref-type="bibr" rid="ref1">0, 1</xref>
        ] controls the relative importance of the
intra-collection likelihoods with respect to the inter-collection ones.
      </p>
      <p>
        The top- ranked documents retrieved from the complementary set  −  is obtained by
computing the top- from the COMBSUM [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ] over each retrieved list external to the collection
, i.e.,

(,  − ) = TOP(COMBSUM( ⋃︁
=1,̸=
 (,  ))).
      </p>
      <p>(3)</p>
      <p>
        After estimating the RLMs (term weight distributions) within and across each collection  as
per Equation 2, we execute the standard steps of RM3 [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] based retrieval, i.e., employ a linear
combination of the original query terms along with the weights for additional terms estimated
by RLM for a second pass retrieval. This gives us  diferent ranked lists for each . Finally,
we employ another COMBSUM to retrieve the top-1000 results.
      </p>
      <sec id="sec-3-1">
        <title>Property</title>
        <p>#Documents
#PubMed abstracts
#Clinical trial doc</p>
      </sec>
      <sec id="sec-3-2">
        <title>Avg Doc. Length #Queries</title>
      </sec>
      <sec id="sec-3-3">
        <title>Dataset Statistics</title>
        <p>Trec 2019</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experimental Setup</title>
      <p>
        4.1. Datasets
We use the TREC 2019 [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and TREC 2020 [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] precision medicine track datasets for our
experiments. The dataset is comprised of a document collection collated from two diferent sources,
namely the PubMed articles and the documents from the ClinicalTrials4 collection. While the
former contains abstracts of published studies, the latter contains early findings of ongoing or
recently completed randomized control trials. The value of , i.e., the number of document
collections in CRM, thus corresponds to 2 for our experiments. Table outlines the characteristics
of the dataset 1.
      </p>
      <p>Dataset Pre-Processing. The documents within the two respective sub-collections are
structured into several diferent fields, e.g., ‘MeshHeading’, ‘Abstract’, ‘Keywords’ etc. While an
option is to index the information from each field separately, after some initial experiments
we found that a flat index structure, i.e., information from all the fields being merged onto a
single one, yielded better retrieval results. Consequently, for all our reported experiments, the
document representations followed a flat bag-of-words approach.</p>
      <p>For the purpose of indexing, we used Lucene5, a Java-based framework. We employed the
standard steps of stopword removal (SMART stop-list) and stemming (Porter stemmer).</p>
      <p>
        Each query in the TREC precision medicine track [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ] is structured into three diferent fields,
namely ‘Gene Name’, ‘Disease Name’ and ‘Demographic Category’. As with the documents, we
also conducted initial experiments seeking to investigate the efect of structured query
representations on retrieval efectiveness. Similar to our observations for the document representation,
it turned out that an unstructured (flat) bag-of-words representation of the queries yielded
better results in comparison to a structured one. Consequently, all our reported experiments
use the unstructured query representation.
      </p>
      <sec id="sec-4-1">
        <title>4https://clinicaltrials.gov/ 5https://lucene.apache.org/</title>
        <p>
          4.2. Baselines
We explored a number of baselines to compare against our proposed approach of PRF. Since our
focus is on investigating how efectively we can exploit all the information present in a given
corpus, we did not consider baseline methods that make use of external corpora or resources.
Each baseline is described below.
1. BM25: We used the standard BM25 retrieval model [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] to retrieve from the index constructed
from the overall collection (i.e., comprising both clinical trials and PubMed articles). The
objective of using BM25 as one of our baselines is to observe how a retrieval model performs
in the absence of any pseudo-relevance feedback on the PMIR task.
2. BM25+RM: In our second baseline, we apply the standard RM-based PRF [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] on an
initial list retrieved with BM25. This baseline is, in fact, an ablation to our proposed model
and corresponds to the situation when term semantics is modeled only within individual
collections.
3. COMBSUM: In this approach, rather than executing search on a single combined index, we
rather apply BM25 on two separate indexes - one for the PubMed abstracts, and the other
for the clinical trial documents). We then combine the two ranked lists obtained from these
two indexes into a single list using the COMBSUM method [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ]. This baseline represents a
relatively simple way of addressing the information of the two sub-collections in a separate
manner, a term in each index having its own local collection statistics and term weights.
        </p>
        <p>
          The TREC 2019 [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] and 2020 [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] Precision medicine tracks mainly used nDCG as the oficial
metric. In addition to nDCG, we use MAP, P@5, P@10 to report the results of our experiments.
Since the objective of all our experiments is to demonstrate the retrieval efectiveness in the
presence of diferent pseudo relevance feedback, in the context of our research scope, MAP is
the most important evaluation metric.
4.3. Proposed Approaches
We now describe the settings for our proposed PRF approach, namely the CRM and its variants.
1. Self-only RM (SRM): This approach, which we call ‘Self-only RM’ (or SRM) uses the same
setup as the COMBSUM method on separate indexes (Section 4.2). The only diference is
that, in contrast to retrieving results only with the initial retrieval and merging the result
lists, in this method we first execute RM-based PRF on each retrieved list. The post-feedback
list of documents are then merged with the COMBSUM method. The objective of using
this baseline is to study the efects of independent PRFs on separate indexes followed by a
post-hoc merging of the results. In this sense, the SRM method is an ablation to our method
because instead of jointly modeling within and across feedback, this method simply applies
a post-hoc merging of results obtained with intra-feedback models.
2. Cross-only RM: This is another ablation for our proposed PRF model of Equation 2, where
we set  = 0 to prune the intra-RLM components. This model exclusively relies on the
cross-collection term semantics dependencies.
        </p>
        <sec id="sec-4-1-1">
          <title>Dataset TREC 2019 TREC 2020</title>
        </sec>
        <sec id="sec-4-1-2">
          <title>Method</title>
        </sec>
        <sec id="sec-4-1-3">
          <title>Baseline</title>
        </sec>
        <sec id="sec-4-1-4">
          <title>Proposed</title>
        </sec>
        <sec id="sec-4-1-5">
          <title>Baseline</title>
        </sec>
        <sec id="sec-4-1-6">
          <title>Proposed</title>
        </sec>
        <sec id="sec-4-1-7">
          <title>Model</title>
          <p>BM25
BM25 + RM</p>
        </sec>
        <sec id="sec-4-1-8">
          <title>COMBSUM</title>
          <p>BM25
BM25 + RM</p>
        </sec>
        <sec id="sec-4-1-9">
          <title>COMBSUM</title>
          <p>SRM ( = 1) 0.2104
Cross-only RM (CRM =0) 0.2129
CRM ( = 0.7) 0.2136
SRM ( = 1) 0.1701
Cross-only RM (CRM =0) 0.1665
CRM ( = 0.7) 0.1746
3. CRM: This is our proposed approach of Equation 2, with  = 2 for the TREC PM collection.</p>
          <p>It models term semantics both for the PubMed articles and the clinical trials separately, as
well as modeling the cross term semantics across the two collections.
4.4. Parameter Setting
For all our experiments, we used BM25 as our initial retrieval model on top of which the PRF
models are eventually applied. The hyper-parameters of each IR model investigated were tuned
with grid search and the best results (along with the parameter configurations) are reported
in Table 2. In particular, the two parameters of BM25, namely  and , were tuned with a grid
search. Both  and  were varied within the interval of 0.1 to 1 in steps of 0.1.</p>
          <p>
            As for the feedback models, there are two parameters common to all the methods that we
investigated, namely the number of feedback documents ( ), and the number of terms () with
the top RM weights used for query expansion. We tuned  in a range from 5 to 20 for each PRF
method and reported the best results in Table 2. Similarly the optimal value of  was found out
to be 5 after tuning it in the range of 5 to 30. Similarly, the value of  , the mixing parameter
for CRM, was also varied in steps of 0.1 within the interval [
            <xref ref-type="bibr" rid="ref1">0, 1</xref>
            ]. The optimum value for  for
CRM is reported in Table 2.
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results</title>
      <p>The results obtained for both TREC 2019 and 2020 precision medicine track datasets are presented
in Table 2. The interesting observations that can be made from Table 2 are as follows.</p>
      <p>Firstly, BM25+RM performs better than BM25 in terms of all the evaluation metrics. Similar
observation follows for COMBSUM and SRM. This observation confirms that the use of PRF
improves retrieval efectiveness for the PMIR task.</p>
      <p>Secondly, the COMBSUM model outperforms BM25. This observation confirms our hypothesis
that the use of sub-collection helps to improve retrieval efectiveness.</p>
      <p>Thirdly, our proposed approach, CRM, significantly outperforms all the baseline and the
ablation approaches for both TREC 2019 and 2020 datasets. This observation supports our
hypothesis that jointly modeling the self and cross relevance models separately on each
subcollection improves the overall retrieval efectiveness.</p>
      <p>
        In TREC 2019 precision medicine task, the best nDCG value reported was 0.5783 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The
method in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] used a supervised approach using external information. Table 2 shows that the
best NDCG value for our proposed approach is 0.5156. This shows that without using any
external information the performance of our proposed approach is comparable to approaches
using external knowledge bases.
      </p>
      <p>Figure 1 shows the efect of varying the parameter  for CRM. It is observed from Figure
1 that for both TREC 2019 and TREC 2020 the best MAP value is obtained for  = 0.7. This
observation indicates that a higher relative importance should be assigned to the intra-collection
term co-occurrence likelihoods in comparison to the inter-collection ones.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions and Future Work</title>
      <p>In this paper we proposed a cross relevance model (CRM) for precision medicine document
retrieval. The proposed approach used a mixture of both intra-collection and inter-collection
relevance models to better model the two diferent types of term dependencies. In future,
we would like to investigate the efect of cross relevance model on collections that do not
have distinct information sources. Instead, we could apply ideas like clustering to partition a
collection into a number of diferent pseudo sub-collections.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Papaioannou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sutton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Carroll</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Booth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Wong</surname>
          </string-name>
          ,
          <article-title>Literature searching for social science systematic reviews: consideration of a range of search techniques</article-title>
          ,
          <source>Health Information &amp; Libraries Journal</source>
          <volume>27</volume>
          (
          <year>2010</year>
          )
          <fpage>114</fpage>
          -
          <lpage>122</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>K.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Demner-Fushman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Voorhees</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. R.</given-names>
            <surname>Hersh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bedrick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Lazar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pant</surname>
          </string-name>
          ,
          <article-title>Overview of the trec 2020 precision medicine track</article-title>
          ,
          <source>The ... text REtrieval conference : TREC. Text REtrieval Conference</source>
          <volume>26</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>K.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Demner-Fushman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Voorhees</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Hersh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bedrick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lazar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pant</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Meric-Bernstam</surname>
          </string-name>
          ,
          <article-title>Overview of the trec 2019 precision medicine track</article-title>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>E.</given-names>
            <surname>Faessler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Oleynik</surname>
          </string-name>
          , U. Hahn,
          <article-title>Julie lab &amp; med uni graz @ trec 2019 precision medicine track</article-title>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lavrenko</surname>
          </string-name>
          , W. B.
          <string-name>
            <surname>Croft</surname>
          </string-name>
          ,
          <article-title>Relevance based language models</article-title>
          ,
          <source>in: Proc. of SIGIR '01</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2001</year>
          , pp.
          <fpage>120</fpage>
          -
          <lpage>127</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Roy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ganguly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mitra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. J.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <article-title>Word vector compositionality based relevance feedback using kernel density estimation</article-title>
          ,
          <source>in: Proc. of CIKM '16</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>1281</fpage>
          -
          <lpage>1290</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>H.</given-names>
            <surname>Zamani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dadashkarimi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shakery</surname>
          </string-name>
          , W. B.
          <string-name>
            <surname>Croft</surname>
          </string-name>
          ,
          <article-title>Pseudo-relevance feedback based on matrix factorization</article-title>
          ,
          <source>in: Proc. of CIKM '16</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2016</year>
          , pp.
          <fpage>1483</fpage>
          -
          <lpage>1492</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Montazeralghaem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zamani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Allan</surname>
          </string-name>
          ,
          <article-title>A reinforcement learning framework for relevance feedback</article-title>
          , in: SIGIR, ACM,
          <year>2020</year>
          , pp.
          <fpage>59</fpage>
          -
          <lpage>68</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P.</given-names>
            <surname>Ogilvie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Voorhees</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Callan</surname>
          </string-name>
          ,
          <article-title>On the number of terms used in automatic query expansion</article-title>
          ,
          <source>Information Retrieval</source>
          <volume>12</volume>
          (
          <year>2009</year>
          )
          <fpage>666</fpage>
          -
          <lpage>679</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>G.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-Y.</given-names>
            <surname>Nie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Robertson</surname>
          </string-name>
          ,
          <article-title>Selecting good expansion terms for pseudo-relevance feedback</article-title>
          ,
          <source>in: SIGIR '08</source>
          ,
          <year>2008</year>
          , p.
          <fpage>243</fpage>
          -
          <lpage>250</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S.</given-names>
            <surname>Robertson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Walker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Beaulieu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gatford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Payne</surname>
          </string-name>
          , Okapi at trec-4,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Chakraborty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ganguly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Caputo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lawless</surname>
          </string-name>
          ,
          <article-title>A factored relevance model for contextual point-of-interest recommendation</article-title>
          ,
          <source>in: Proc. of ICTIR '19</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2019</year>
          , pp.
          <fpage>157</fpage>
          -
          <lpage>164</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.</given-names>
            <surname>Datta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ganguly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Roy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bonin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Jochim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mitra</surname>
          </string-name>
          ,
          <article-title>Retrieving potential causes from a query event</article-title>
          , in: SIGIR, ACM,
          <year>2020</year>
          , pp.
          <fpage>1689</fpage>
          -
          <lpage>1692</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>H.</given-names>
            <surname>Zamani</surname>
          </string-name>
          , W. B.
          <string-name>
            <surname>Croft</surname>
          </string-name>
          ,
          <article-title>Relevance-based word embedding</article-title>
          ,
          <source>in: Proc. of SIGIR '17</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2017</year>
          , p.
          <fpage>505</fpage>
          -
          <lpage>514</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>X.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Kurland</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Culpepper</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Craswell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Rom</surname>
          </string-name>
          ,
          <article-title>Relevance modeling with multiple query variations</article-title>
          ,
          <source>in: Proc. of ICTIR '19</source>
          ,
          <year>2019</year>
          , p.
          <fpage>27</fpage>
          -
          <lpage>34</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ma</surname>
          </string-name>
          , H. Lu, S. Ma,
          <article-title>Dual cross-media relevance model for image annotation</article-title>
          ,
          <source>in: Proc. of the 15th ACM International Conference on Multimedia, Association for Computing Machinery</source>
          ,
          <year>2007</year>
          , p.
          <fpage>605</fpage>
          -
          <lpage>614</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lv</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          ,
          <article-title>Positional relevance model for pseudo-relevance feedback</article-title>
          ,
          <source>in: Proc. of the 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>2010</year>
          , p.
          <fpage>579</fpage>
          -
          <lpage>586</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lavrenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Choquette</surname>
          </string-name>
          , W. B.
          <string-name>
            <surname>Croft</surname>
          </string-name>
          ,
          <article-title>Cross-lingual relevance models</article-title>
          ,
          <source>in: Proc. of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>2002</year>
          , p.
          <fpage>175</fpage>
          -
          <lpage>182</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>F.</given-names>
            <surname>Diaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Metzler</surname>
          </string-name>
          ,
          <article-title>Improving the estimation of relevance models using large external corpora</article-title>
          ,
          <source>in: Proc. of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          ,
          <year>2006</year>
          , p.
          <fpage>154</fpage>
          -
          <lpage>161</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Akella</surname>
          </string-name>
          ,
          <article-title>Concept-based relevance models for medical and semantic information retrieval</article-title>
          ,
          <source>in: Proc. of the 24th ACM International on Conference on Information and Knowledge Management, Association for Computing Machinery</source>
          ,
          <year>2015</year>
          , p.
          <fpage>173</fpage>
          -
          <lpage>182</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <article-title>Biomedical Information Retrieval Incorporating Knowledge Graph for Explainable Precision Medicine</article-title>
          ,
          <year>2020</year>
          , p.
          <fpage>2486</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>V.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Karimi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <article-title>An experimentation platform for precision medicine</article-title>
          ,
          <source>in: Proc. of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, Association for Computing Machinery</source>
          ,
          <year>2019</year>
          , p.
          <fpage>1357</fpage>
          -
          <lpage>1360</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hauskrecht</surname>
          </string-name>
          ,
          <article-title>Improving biomedical document retrieval using domain knowledge</article-title>
          ,
          <source>in: Proc. of the SIGIR, Association for Computing Machinery</source>
          ,
          <year>2008</year>
          , p.
          <fpage>785</fpage>
          -
          <lpage>786</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>D.</given-names>
            <surname>Trieschnigg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Kraaij</surname>
          </string-name>
          , F. de Jong,
          <article-title>The influence of basic tokenization on biomedical document retrieval</article-title>
          ,
          <source>in: Proc. of SIGIR</source>
          <year>2007</year>
          ,
          <year>2007</year>
          , p.
          <fpage>803</fpage>
          -
          <lpage>804</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>B.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ma</surname>
          </string-name>
          , L.
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Yang</surname>
          </string-name>
          ,
          <article-title>Improve biomedical information retrieval using modified learning to rank methods</article-title>
          ,
          <source>IEEE/ACM Trans. Comput. Biol. Bioinformatics</source>
          <volume>15</volume>
          (
          <year>2018</year>
          )
          <fpage>1797</fpage>
          -
          <lpage>1809</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>J.</given-names>
            <surname>Qu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Arguello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <source>Towards Explainable Retrieval Models for Precision Medicine Literature Search</source>
          ,
          <year>2020</year>
          , p.
          <fpage>1593</fpage>
          -
          <lpage>1596</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Shaw</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. A.</given-names>
            <surname>Fox</surname>
          </string-name>
          ,
          <article-title>Combination of multiple searches</article-title>
          , in: D. K. Harman (Ed.),
          <source>Proceedings of The Third Text REtrieval Conference</source>
          , TREC 1994, Gaithersburg, Maryland, USA, November 2-
          <issue>4</issue>
          ,
          <year>1994</year>
          , volume
          <volume>500</volume>
          -225 of NIST Special Publication,
          <source>National Institute of Standards and Technology (NIST)</source>
          ,
          <year>1994</year>
          , pp.
          <fpage>105</fpage>
          -
          <lpage>108</lpage>
          . URL: http://trec.nist.gov/pubs/ trec3/papers/vt.ps.gz.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Jaleel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Allan</surname>
          </string-name>
          , W. B.
          <string-name>
            <surname>Croft</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Diaz</surname>
            ,
            <given-names>L. S.</given-names>
          </string-name>
          <string-name>
            <surname>Larkey</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>M. D.</given-names>
          </string-name>
          <string-name>
            <surname>Smucker</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Wade</surname>
          </string-name>
          , Umass at TREC 2004:
          <article-title>Novelty and HARD</article-title>
          ,
          <source>in: TREC</source>
          <year>2004</year>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>