<!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>DEMIR at CLEF eHealth: The Effects of Selective Query Expansion to Information Retrieval</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Okan Ozturkmenoglu</string-name>
          <email>okan.ozturkmenoglu@deu.edu.tr</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Adil Alpkocak</string-name>
          <email>alpkocak@cs.deu.edu.tr</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Deniz Kilinc</string-name>
          <email>deniz.kilinc@cbu.edu.tr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Celal Bayar University, HFT Technology Faculty Turgutlu</institution>
          ,
          <addr-line>Manisa</addr-line>
          ,
          <country country="TR">Turkey</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Dokuz Eylül University, Dept. Computer Engineering, DEMIR Dokuz Eylül Multimedia Information Retrieval Research Group</institution>
          ,
          <addr-line>Tinaztepe Izmir 35390</addr-line>
          ,
          <country country="TR">Turkey</country>
        </aff>
      </contrib-group>
      <fpage>220</fpage>
      <lpage>225</lpage>
      <abstract>
        <p>This paper presents the details of participation of DEMIR (Dokuz Eylül University Multimedia Information Retrieval) research team to the Share/CLEF eHealth 2014. This year, we participated to task 3a: monolingual user-centered health information retrieval. In this task, we focused to apply query expansion techniques selectively to some queries to improve the performance of information retrieval. Thus, we first extracted some statistical features from queries such as length of query, sum and intersect of document frequencies of each query term etc. We develop a system to predict if a query is to be expanded or not. Then, we trained our system with previous year's data. Then, we applied a query expansion method only to the queries, which are selected by the system. The results show that the approach we proposed slightly improves our baseline retrieval performance in terms of P@10.</p>
      </abstract>
      <kwd-group>
        <kwd>Query classification</kwd>
        <kwd>selective query expansion</kwd>
        <kwd>information retrieval</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In this paper, we present the experiments performed by Dokuz Eylül University
Multimedia Information Retrieval (DEMIR) Research Group, in the context of our
participation to the ShARe/CLEF eHealth Evaluation Lab [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. This year, we
participated to task 3a: monolingual user-centered health information retrieval [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. This task
is a standard information retrieval task as retrieving the relevant documents for a
given set of user topics/queries. This task uses 2012 crawl of approximately one million
medical documents made available by the EU-FP7 Khresmoi project
(http://www.khresmoi.eu/). The main focus of our participation is to apply query
expansion methods to a set of queries selectively instead of the whole set. This is
because, there is no query expansion method improves retrieval performance for all
queries. A query expansion method works well on some queries or query type while it
doesn’t work for other queries. If we can predict the queries to be expanded
beforehand, it would be great for retrieval performance. Then we can apply the query
expansion on a selected set of queries predicted to be potential to improve the
information retrieval performance. We called this approach as selective query expansion
[
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6">3-6</xref>
        ]. We experiment our proposed approach at 2013 dataset in CLEF eHealth. To do
this, we extracted some statistical features for type of queries from indexed
documents and used them as attributes in classification. After classification, we predict if a
query is going to be expanded or not. We obtained a slight improvement with 2013
data. Thus, we applied this approach to this year data.
      </p>
      <p>Rest of the paper is organized as follow: Section 2 provides an explanation of
statistical features of query text and describes query classification process. In the next
section 3 we present our experimental results. Section 4 concludes the paper by
pointing out the open issues and possible avenues of further research for applying query
expansion methods selectively in information retrieval system.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Classification of Queries</title>
      <p>Task 3a contains approximately one million medical documents, which are
collected different web sources. They are in eight-part folder and each document is taken
formatted style in own source file which extension is dat. We processed these dat files
and extracted all documents as a single file, which can be indexed and retrieved in IR
system.</p>
      <p>In original document collection, data structure contains HTML tags in content tag
so when we processed them, we stripped out HTML tags and used title, heading and
body information in it. We created a new content data and document data structure
using these tags information. So we used this new data structure in IR system.</p>
      <p>
        In this work, we tested effect of selective query expansion method in IR system
performance. As in standard IR system, we preprocess document collection and
indexed them. We used Terrier IR Platform API, which is an open source search engine
written in Java and is developed at the School of Computing Science, University of
Glasgow, to generate vector space model [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Terrier provides efficient and effective
search methods supported by many different parameters.
      </p>
      <p>
        Before retrieval, we processed the queries and extracted statistics of query terms
from data collection [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. The extracted features for query types are as follows:
• Query length (QE): The number of terms in a query.
• Intersect document frequency (IntersectDF): The number of documents in the
collection that contain all terms in a query.
• Maximum document frequency (MaxDF): The maximum document
frequency (df) of query terms.
• Minimum document frequency (MinDF): The minimum document frequency
of query terms.
• Summation document frequency (SumDF): The summation document
frequencies of all query terms.
• Average document frequency (AvgDF): The average of document
frequencies of all query terms.
• Maximum inverse document frequency (MaxIDF): Inverse of maximum
document frequency of query terms.
• Minimum inverse document frequency (MinIDF): Inverse of minimum
document frequency of query terms.
• Average Term Frequency (AvgTF): The average term frequency, which is
total number of occurrence of the term in the collection.
      </p>
      <p>
        We used all these statistical information as attributes for classification process of
queries. To classify the queries as to be expanded and not to be expanded, we used
Naïve Bayes method in WEKA machine learning software [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>We performed the training and test sets in the following way. We retrieved two
groups of result for 2013 data. We applied baseline method in one of them is
described in section 3.2 and is shown as  1 in equation 1. In addition to the first group,
only we used KL method as query expansion model in another one and it is shown as
 2 in equation 1. This expansion model was better model than others, we experiment
it for 2013 data and we explained it in section 3.1. During creation of training set, we
calculated difference of map score in retrieval result between these two groups for
each query.</p>
      <p>_
_
_ 
=  2
−  1</p>
      <p>We used  _ _ _ value in equation 1 when we decided to
query’s class. If this value was positive, we labelled query as positive and so we applied
query expansion model in this query when we retrieved. If difference is zero or
negative, we did not apply any model. We formulated this function in equation 2.</p>
      <p>, 
 ( ) =  , 
_
_
_
_
&gt; 0
≤ 0</p>
      <p>In 2013 data, we labelled 21 queries as positive, 29 queries as negative. It means
that using query expansion improved retrieval performance in 21 queries. For
evaluation of our labeling function is shown in Eq. 2, we used Naïve Bayes method as
classifier in WEKA as test dataset, and applied 10-fold cross validation. Our classification
accuracy is around 70% for 2013 queries. Likewise for 2014 data, we used 2013
queries as training set and 2014 queries as test set and performed a prediction with 2014
queries if a query is to be expanded or not. After classification, we predicted query’s
class as positive or negative for query expansion. If the result is positive, we
expanded it using KL expansion model in Terrier and did not expand the query if otherwise.
(1)
(2)
3
3.1</p>
    </sec>
    <sec id="sec-3">
      <title>Experiments and Results</title>
      <p>Experiments</p>
      <p>In order to assess our proposal, we set up a set of experiments on the 2013 data
collection of CLEF eHealth. In experiments, our aim was which weighting-model, query
field and expansion method was used in runs.</p>
      <p>Between run 1_1 and 1_3, we used title tag as query field and different weighting
models such as TF×IDF, BM_25 and DFR_BM25, while retrieving. By the way, we
did not use any expansion method. We obtained that TF×IDF is best among them. In
run 2_1 and 2_2, we tried to find out which query fields should be used in retrieval. In
data collection, each query has title, desc, profile and narr information. We used only
title tag, because its performance is the best. In run 3_1 and 3_3, we aimed to choose
which query expansion method to be used. In this test, we used only title tag, TF×IDF
weighting-model and three different query expansion models such as Bo1, Bo2 and
KL which are available in Terrier. We obtained the best result with KL method.</p>
      <p>Table 1 shows our experimental results for last year data collection and queries.
According to these results, we decided to use title tag as a query field, TF×IDF as a
weighting-model, KL as a query expansion method in our submitted runs.
• DEMIR_EN_Run.1: This run is our baseline retrieval result. In this run, title
and content tag is used to index documents. Term-weighting model is
TF×IDF. UTF tokenizer and stopword list were used and we applied porter
stemmer. Query expansion model was not used. We used title field in query
file for each topic when retrieved. We obtained the best result in CLEF
eHealth 2013, using this method so we have it as a baseline for this year.
• DEMIR_EN_Run.5: This run is exactly the same with baseline run except for
all queries we used KL query expansion method available in Terrier.
• DEMIR_EN_Run.6: In this run, we applied similar pre-process and indexing
operations on documents like run 1 and 5. For query expansion model, we
extracted term statistics such as QE, IntersectDF, MaxDF, MinDF, SumDF,
AvgDF, MaxIDF, MinIDF and AvgTF from queries. We used them as
attributes and applied Naïve Bayes classification method. As a result of
classification, we expect to predict which query to expand. 27 queries are positive and
other 23 queries are negative. We expanded positive queries using KL query
expansion model, which were selected by classification process. We did not
expanded negative queries.
• DEMIR_EN_Run.7: In this run, we selected queries manually which were
expanded. We called it as blind query expansion. We labelled 16 queries as
positive and others were negative. We expanded positive queries.</p>
      <p>In this year, we tried to classify queries as to be expanded or not. This is because
there is no query expansion methods works for all type of queries. In other say, a
query expansion method improves only a set of queries and worsens the rest. Thus, it
would be great if we can predict which queries to be expanded. This is the basic idea
of our study. Hence, we tried to classify or predict the queries to which an expansion
method will work effectively and we apply it on them and expect to improve retrieval
performance.</p>
      <p>So in this work, we performed query expansion on a selected set of queries instead
of the whole queries and expect a performance improvement. The results we obtained
showed that the approach we proposed slightly improves our baseline retrieval
performance in terms of P@10. It shows that it is promising and needs further studies on
this topic.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <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>Schrek</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leroy</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mowery</surname>
            ,
            <given-names>D.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Velupillai</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chapman</surname>
            ,
            <given-names>W.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martinez</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zuccon</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palotti</surname>
          </string-name>
          , J.:
          <source>Overview of the ShARe/CLEF eHealth Evaluation Lab 2014</source>
          . Springer, (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Goeuriot</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kelly</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palotti</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pecina</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zuccon</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hanbury</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jones</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mueller</surname>
          </string-name>
          , H.:
          <source>ShARe/CLEF eHealth Evaluation Lab</source>
          <year>2014</year>
          ,
          <article-title>Task 3: User-centred health information retrieval</article-title>
          . (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Cronen-Townsend</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Croft</surname>
          </string-name>
          , W.B.:
          <article-title>A language modeling framework for selective query expansion</article-title>
          .
          <source>DTIC Document</source>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Bashir</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rauber</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>On the relationship between query characteristics and IR functions retrieval bias</article-title>
          .
          <source>Journal of the American Society for Information Science and Technology</source>
          <volume>62</volume>
          ,
          <fpage>1515</fpage>
          -
          <lpage>1532</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>He</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ounis</surname>
            ,
            <given-names>I.:</given-names>
          </string-name>
          <article-title>Query performance prediction</article-title>
          .
          <source>Information Systems</source>
          <volume>31</volume>
          ,
          <fpage>585</fpage>
          -
          <lpage>594</lpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kumaran</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carvalho</surname>
            ,
            <given-names>V.R.</given-names>
          </string-name>
          :
          <article-title>Reducing long queries using query quality predictors</article-title>
          .
          <source>In: Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval</source>
          , pp.
          <fpage>564</fpage>
          -
          <lpage>571</lpage>
          . ACM, (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Ounis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Amati</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Plachouras</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>He</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Macdonald</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lioma</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Terrier: A High Performance and Scalable Information Retrieval Platform</article-title>
          .
          <source>In: Proceedings of ACM SIGIR'06 Workshop on Open Source Information Retrieval (OSIR</source>
          <year>2006</year>
          ).
          <article-title>(</article-title>
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raghavan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schütze</surname>
          </string-name>
          , H.: Introduction to Information Retrieval. Cambridge University Press (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Hall</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frank</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Holmes</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pfahringer</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reutemann</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Witten</surname>
            ,
            <given-names>I.H.</given-names>
          </string-name>
          :
          <article-title>The WEKA data mining software: an update</article-title>
          .
          <source>SIGKDD Explor. Newsl</source>
          .
          <volume>11</volume>
          ,
          <fpage>10</fpage>
          -
          <lpage>18</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>