<!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>sMARE: An Enhanced Query Performance Prediction Evaluation Approach</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>(Discussion Paper)</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Guglielmo Faggioli</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleg Zendel</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>J. Shane Culpepper</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nicola Ferro</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Falk Scholer</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>RMIT University</institution>
          ,
          <addr-line>Melbourne</addr-line>
          ,
          <country country="AU">Australia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Padova</institution>
          ,
          <addr-line>Padova</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>QPP has been studied extensively in the IR community over the last two decades. Nevertheless, the Query Performance Prediction (QPP) field still lacks sound theoretical evaluation methodologies. In this work∗, we re-examined the existing evaluation methodology commonly used for QPP, and propose a new approach. Our key idea is to model QPP performance as a distribution instead of relying on point estimates. Our work demonstrates important statistical implications and overcomes key limitations imposed by the currently used correlation-based point-estimate evaluation approaches. This, in turns, enables the use of ANalysis Of VAriance (ANOVA) models for comparative analyses, permitting deeper analyses on the QPP models performance, and allowing to measure interactions between multiple factors.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The Information Retrieval (IR) community has long recognized the importance of applying
statistical tests to evaluation results. Although best practices continue to evolve, conference
and journal guidelines and discussion papers [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] have led the community to appreciate the
importance of a more theoretically grounded evaluation. While this has led to higher quality
analytical comparisons in many IR-related fields, not all areas have adopted the practice. An
example of a common IR problem that might benefit from alternative evaluation techniques
is Query Performance Prediction (QPP). The goal of QPP is to estimate the efectiveness of a
retrieval system in response to a query when no relevance judgments are available [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The most
widely-used method for evaluating QPP approaches is based on the strength of a relationship
between per-topic prediction scores, and the actual per-topic system efectiveness as measured
using a standard IR efectiveness metric, usually Average Precision ( AP). Such association is
measured using a correlation coeficient: a QPP approach that achieves a higher correlation
value than another is taken to be the superior approach. This evaluation method compares QPP
efectiveness at a very high level, with the performance of a QPP approach over a whole set of
topics being summarized just by a correlation coeficient as a point value. In order to statistically
validate the results, by relying on repeated randomized topic sampling, we can test whether or
not the correlation coeficients for two diferent QPP methods are significantly diferent from
each other. However, it is important to note that this approach is fundamentally diferent from
the pair-wise significance test used for system retrieval efectiveness, which is now common
practice in IR evaluation exercises. Motivated by these observations, we re-examine how QPP
eficacy can be analyzed using a more fine-grained approach – by modeling the performance of
QPP techniques as distributions. This approach has also previously been applied successfully in
system evaluation exercises. A distribution-based model can be constructed as follows. First, an
estimate of the performance for each system-topic combination is computed using a traditional
performance measure, such as AP. Then, all of the topics for a collection are used to model
the performance distribution. Note that this is fundamentally diferent from a classical QPP
evaluation approach.
      </p>
      <p>
        In this work, we propose an evaluation approach (dubbed scaled Mean Absolute Rank Error
(sMARE)) which has several appealing properties: it allows formal inferential statistics to be
applied, which generalizes the results to the entire population of topics; it allows the behavior
of a QPP approach to be more clearly isolated, for example through confidence intervals; and, it
enables factor decomposition, which in turn allows us to measure the relative contributions to
observed efectiveness systematically. We also incorporate recent work in retrieval efectiveness
on query variation and reformulation of each topic [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] into our framework, which allows a more
ifne-grained sampling of retrieval performance, and to estimate interaction between systems,
topics and query formulations, which is not possible using only a single point estimate.
      </p>
      <p>Our work focuses on two related research questions: (RQ1) How can statistical analysis and
testing be applied to QPP evaluation exercises? (RQ2) What factors contribute to improving or
reducing the performance of a QPP model?</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Retrieval performance can vary widely across diferent systems, even for a single query [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
Pre-retrieval predictors analyze query and corpus statistics prior to retrieval [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] while
postretrieval predictors also analyze the retrieval results [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Predictors are typically evaluated by
measuring the correlation coeficient between the AP values attained with relevance judgments
and the values assigned by the predictor. Such evaluation methodology is based on a point
estimate and have been shown to be unreliable when comparing multiple systems, corpora
and predictors [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Hauf et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] demonstrate that higher correlation does not necessarily
attest to better prediction, and used Root Mean Square Error (RMSE) in their evaluation. When
computing the Confidence Interval ( CI) for Pearson’s linear correlation in the evaluation using
multiple previously reported pre-retrieval predictors, Hauf et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] found that many of the
predictors had overlapping CIs, and concluded that they were not significantly diferent from
the best performing predictor. Also of interest, recent work using query variations for QPP [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]
has demonstrated that the relative prediction quality of predictors can vary with respect to
the efectiveness of the queries used to represent the topics, and we explore such observation
further using advanced statistical instrumentation.
      </p>
      <p>One principled approach that can be used in IR evaluation is ANOVA[8, 9, 10]. ANOVA is
commonly used to assess the presence of statistically significant diferences in mean performance
observed when using diferent experimental conditions. This technique can be operationalized
as a General Linear Mixed Model (GLMM), where a response variable, called , is linearly
modeled into two parts: the experimental conditions (the  ) and the :  =
  + . The   includes a subject component (which in IR evaluation often
corresponds to the topic), one or more factors, which are the diferent experimental conditions
(e.g, the entire system, or its components), and possibly their interactions. Specific factors might
be nested inside others: in the following analyses, query formulations are a nested factor of
the topic, since each formulation represents a single topic and cannot be used to represent
others. The ANOVA approach is particularly useful in our work as it allows us to break down
the variance observed in the data, assigning it to the factors that caused it [9].</p>
    </sec>
    <sec id="sec-3">
      <title>3. Experimental Analysis</title>
      <p>
        In our analyses, we use the TREC Robust 2004 (Robust04) Ad Hoc [11] collection. We enrich
the set of queries for the corpus using publicly available human-curated query variants for each
topic [12].1 Our experiments use a Grid of Points (GoP) of runs, using 4 diferent stoplists ( atire,
zettair, indri, lingpipe), plus the no stop approach and 2 diferent stemmers, ( lovins,
porter) plus a no stem approach. All the runs were produced using the query-likelihood
model. We experimented with the following pre-retrieval qpp models: SCQ, AvgSCQ, MaxSCQ,
SumVAR, AvgVAR, MaxVAR [13], AvgIDF [14], MaxIDF [15]. Concerning post-retrieval qpp
models, we considered the followings: Clarity [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], NQC [16], WIG [17], SMV [18]. We duplicate
the number of post-retrieval methods, considering, for each of them, their UEF [19] counterpart.
Such QPP models have been selected since they are the most well-known and representative. In
total, 240 diferent predictor-system combinations were generated for the Robust04 collection.
For predictors which required hyper-parameters, we considered those previously observed to
be efective [ 16]. We apply Average Precision (AP) to measure the efectiveness of the diferent
retrieval pipelines.
      </p>
      <sec id="sec-3-1">
        <title>3.1. Traditional QPP evaluation using correlations</title>
        <p>Prior work on QPP has relied primarily on a single evaluation paradigm: the QPP generates a
candidate list where the queries are ranked by their prediction values. The correlation between
such list and a list induced using a reference measure, such as AP, is then considered as measure
of quality of the QPP model.</p>
        <p>Figure 1a shows the performance of 16 diferent QPP models when using this common
evaluation approach – Kendall’s  correlation in this case – with 95% confidence intervals
shown as well. In this example, the results are generated for a specific retrieval pipeline, using
the indri stoplist and porter stemmer. To compute the confidence intervals (at significance
level  = 0.05), we used a bias-corrected and accelerated bootstrap procedure with 10,000
samples. Observe that when using title queries only (orange bars), there is a large degree of
overlap between the diferent QPP approaches. The pairwise comparison using the data from
Figure 1a (title queries only), shows that 57 pairs of predictors are found to be significantly</p>
        <sec id="sec-3-1-1">
          <title>1http://culpepper.io/publications/robust-uqv.txt.gz</title>
          <p>
            (a) Prediction quality of the selected QPP models (b) Confidence Intervals of AP induced scaled
on Robust04 (Confidence Intervals computed Mean Absolute Rank Error (sMARE ) from
with Kendall’s  ), using either title queries or all MD0micro on the Robust04 title queries.
available formulations.
diferent, out of 120 total pairs of QPP models (47.5%). This suggests that using confidence
intervals does indeed make it dificult to decide which QPP system is the best performing, as
suggested by [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ].
          </p>
          <p>In addition to using the traditional title queries, we also explore the scenario of using multiple
formulations, which allows us to produce replicas for the same experimental conditions (i.e.,
the retrieval system or the QPP model used) on the same subject (i.e., the topic). While the
performance is generally lower when using multiple topic formulations (the blue bars shown
in Figure 1a), there is a high degree of similarity between the ordering of the QPP models for
multiple query formulations to the ordering for title-only (Kendall’s tau correlation between
using title-only versus multiple queries per topic is 0.98,  &lt; 0.0001). Overall, the bootstrap
intervals are substantially larger if a traditional title-only evaluation approach is used, which
makes it less suitable for determining if any single system is a clear winner, while using
multiple queries does induce smaller intervals and better discriminative power between the
QPP approaches.</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. ANOVA modeling and analysis of QPP</title>
        <p>
          To support a more detailed analysis of QPP methods and associated factors, we now explore the
use of ANOVA. Instead of computing the correlations between the complete lists, we measure
the diference, for each query, in the rank position assigned by a QPP method and the ground
truth rank position assigned by AP. Ties in ranks are broken using the average of tie rank spans,
as is the default in many statistical applications. Observe that this transitions us from point
estimates of a single correlation value for the two lists over a whole set of topics to a distribution
of the rank diferences between the two lists for each query in the set. In order to scale the
scores to the range [
          <xref ref-type="bibr" rid="ref1">0, 1</xref>
          ] we divide them by the number of samples. The error, labeled as AP
Note that sMARE can be seen as a derivation of Spearman’s Footrule distance, making it
a metric for the full rankings instead of a correlation. Among the properties of Spearman’s
Footrule distance, Diaconis and Graham [20] list that it is bounded between [0, ⌊0.52⌋], where
 is the length of the ranking. Since both sARE and sMARE are normalized by the
number of queries, sMARE is bounded between [0, 0.5]. The proposed metric presents a
Kendall’s  correlation coeficient with the original metric higher than 0.99 ( &lt; 0.0001) for all
configurations.
        </p>
        <p>We are in a position to introduce our first ANOVA model which will enable a more comprehensive
experimental analysis of the results.</p>
        <p>iqrs =  +  i +  q +  r +  s + iqrs
(MD0micro)
where: i... is the performance (sARE ) on the -th topic (using the specified QPP pipeline);  is
the grand mean;  i is the efect of the -th topic (represented with the title query formulation);  q,
 r , and  s are the efect of the -th stoplist, the -th stemmer, and the -th QPP model; iqrs is the
error component. Such ANOVA shows that all factors are significants. Furthermore, we observe
a large size 2 efect for the topic ( &lt;2&gt; = 0.410). Both the stoplist and the stemmer factors
are significant, but with a negligible efect ( &lt;2&gt; = 0.001 and &lt;2&gt; = 0.004),
while the QPP model displays a small efect ( &lt;2 &gt; = 0.036). Based on the results of this
analysis, we also ran a Tukey’s Honestly Significant Diference ( HSD) post-hoc analysis to test
for pairwise diferences. Figure 1b shows the Tukey’s HSD confidence intervals for sMARE
over the diferent QPP models.</p>
        <p>When comparing Figure 1a (orange bars) and Figure 1b, we can observe that there is less
overlap between the CIs, in particular, we observe that, by computing the -values for the
pairwise comparisons, out of 120 pairs of predictors, 96 of them are significantly diferent
(80.0%). Thus, compared to the results observed for the bootstrap-based approach, we are able
to diferentiate between 68.4% more pairs of predictors. The “Topic” factor is responsible for
the largest part of the variance; this is in line with results from IR efectiveness evaluation (see
for example Tague-Sutclife and Blustein [21]). Thus, the estimation of the performance for a
specific QPP model can vary significantly as it is dependent on properties of the underlying
collection (performance diferences in topics/queries). By removing the contribution of the
topics from the global variance, ANOVA removes any volatility in the underlying experimental
data allowing the relative performance of predictors to be compared more precisely. When using
only correlations aggregated across all topics, such information is lost, while an ANOVA analysis
facilitates more discriminative performance comparisons between systems by systematically
accounting for each factor separately.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. ANOVA modeling of multiple queries and interactions</title>
        <p>One of the most interesting aspects of our framework is the capability to compute the efect
sizes of interactions between factors. This is achieved using MD1micro
ijqrs =  +  i +  j(i) +  q +  r +  s + (  )iq + (  )ir + (  )is
+ ( )j(i)q + ( )j(i)r + ( )j(i)s + ( )qr + ( )qs + ( )rs + ijqrs
(MD1micro)
which extends MD0micro to include  j(i) to represent the efect of the -th query formulation for
the -th topic. Moreover, this model considers all of the possible two-way interactions which
are now computable using the replicates provided by the multi-query topic formulations.</p>
        <p>Table 1 presents the ANOVA summary statistics for MD1micro. In this analysis we add the
query formulations as a nested factor for each topic, in this case we randomly chose 5 for
each topic.2 The table empirically shows that the largest diferences in QPP performance are
due to the topics, and their formulations. The efect for the QPP factor is medium-sized. The
significance of the stoplist and stemmer factors suggests that they afect the overall prediction
quality, and practitioners should consider all possible factors when comparing and contrasting
QPP performance for a corpus. We are now in a position to observe the interaction between
topics (and their query formulations) and the predictors, which is large, indicating that important
diferences between QPP model performance exists within reformulations of a single topic.
Finding the QPP model where interactions are smallest is valuable in practice as this corresponds</p>
        <sec id="sec-3-3-1">
          <title>2The topic with the minimal number of query formulations had 5 formulations.</title>
          <p>to be choosing a model that is most robust to query reformulation. Additionally, this enables a
series of additional analyses, such as a failure analysis for topics with the largest interaction
with a QPP model.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>We have presented a novel evaluation framework for QPP. The framework estimates the
performance of QPP on every topic as the distance between its predicted rank - computed using
the QPP – and the expected one – measured through AP (or any other traditional IR measure).
This allows us to obtain a distribution of performance for the QPP over the diferent topics.
Furthermore, our framework makes use of multiple query formulations for each topic to enhance
the power of our analyses. Together, the use of multiple query formulations and the distributional
representation of the performance enables carrying out more accurate studies. In particular, we
showed that it is possible to rely on the statistical properties of ANOVA and corresponding post
hoc procedures to better identify pairs of QPP approaches that are statistically significantly
diferent. The newly proposed framework also enables the analysis of interaction efects for
QPP models and topics, allowing failure analyses and a deeper understanding into how a QPP
model works. Our framework can be extended and adapted to diferent investigation needs. The
two-way ANOVA described in MD0micro is suficient to determine if QPP models are significantly
diferent, and has the added benefit of relying on a statistically-sound framework. In future
work, we plan to study additional components of the evaluation framework, such as the impact
of the ranking methods which are used to establish “ground truth” performance; new factors
that influence QPP systems such as the ranking approach used in the post-retrieval QPP; and
the efects of using multiple corpora, in order to more comprehensively model and understand
corpus and QPP interactions.
[8] D. Banks, P. Over, N.-F. Zhang, Blind Men and Elephants: Six Approaches to TREC data,</p>
      <p>Information Retrieval 1 (1999) 7–34.
[9] N. Ferro, G. Silvello, A General Linear Mixed Models Approach to Study System Component</p>
      <p>Efects, in: Proc. SIGIR, 2016, pp. 25–34.
[10] G. Faggioli, N. Ferro, System efect estimation by sharding: A comparison between anova
approaches to detect significant diferences (2021).
[11] E. M. Voorhees, Overview of the TREC 2004 Robust Track, in: Proc. TREC, 2004.
[12] R. Benham, J. S. Culpepper, Risk-Reward Trade-ofs in Rank Fusion, in: Proc. ADCS, 2017,
pp. 1:1–1:8.
[13] Y. Zhao, F. Scholer, Y. Tsegay, Efective Pre-retrieval Query Performance Prediction Using</p>
      <p>Similarity and Variability Evidence, in: Proc. ECIR, 2008, pp. 52–64.
[14] S. Cronen-Townsend, Y. Zhou, W. B. Croft, A Language Modeling Framework for Selective</p>
      <p>Query Expansion, Technical Report, 2004.
[15] F. Scholer, H. E. Williams, A. Turpin, Query Association Surrogates for Web Search, J.</p>
      <p>Assoc. Inf. Sci. Technol. 55 (2004) 637–650.
[16] A. Shtok, O. Kurland, D. Carmel, F. Raiber, G. Markovits, Predicting Query Performance
by Query-Drift Estimation, ACM Trans. Inf. Syst 30 (2012) 1–35.
[17] Y. Zhou, W. B. Croft, Query Performance Prediction in Web Search Environments, in:</p>
      <p>Proc. SIGIR, 2007, p. 543–550.
[18] Y. Tao, S. Wu, Query Performance Prediction By Considering Score Magnitude and</p>
      <p>Variance Together, in: Proc. CIKM, 2014, p. 1891–1894.
[19] A. Shtok, O. Kurland, D. Carmel, Using Statistical Decision Theory and Relevance Models
for Query-Performance Prediction, in: Proc. SIGIR, 2010, pp. 259–266.
[20] P. Diaconis, R. L. Graham, Spearman’s Footrule as a Measure of Disarray, J. Royal Stat.</p>
      <p>Soc. 39 (1977) 262–268.
[21] J. M. Tague-Sutclife, J. Blustein, A Statistical Analysis of the TREC-3 Data, in: Proc. TREC,
1994, pp. 385–398.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>G.</given-names>
            <surname>Faggioli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Zendel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Culpepper</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Scholer</surname>
          </string-name>
          ,
          <article-title>An Enhanced Evaluation Framework for Query Performance Prediction</article-title>
          ,
          <source>in: Proc. ECIR</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>115</fpage>
          -
          <lpage>129</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>N.</given-names>
            <surname>Fuhr</surname>
          </string-name>
          ,
          <article-title>Some Common Mistakes In IR Evaluation, And How They Can Be Avoided</article-title>
          ,
          <source>SIGIR Forum 51</source>
          (
          <year>2017</year>
          )
          <fpage>32</fpage>
          -
          <lpage>41</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Carmel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Yom-Tov</surname>
          </string-name>
          ,
          <article-title>Estimating the Query Dificulty for Information Retrieval</article-title>
          , Morgan &amp; Claypool Publishers, USA,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>O.</given-names>
            <surname>Zendel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shtok</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Raiber</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>
          , Information Needs, Queries, and
          <string-name>
            <surname>Query</surname>
          </string-name>
          Performance Prediction,
          <source>in: Proc. SIGIR</source>
          ,
          <year>2019</year>
          , p.
          <fpage>395</fpage>
          -
          <lpage>404</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Cronen-Townsend</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          , W. B.
          <string-name>
            <surname>Croft</surname>
          </string-name>
          , Predicting Query Performance,
          <source>in: Proc. SIGIR</source>
          ,
          <year>2002</year>
          , pp.
          <fpage>299</fpage>
          -
          <lpage>306</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Aslam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Pavlu</surname>
          </string-name>
          ,
          <article-title>Query Hardness Estimation Using Jensen-Shannon Divergence Among Multiple Scoring Functions</article-title>
          ,
          <source>in: Proc. ECIR</source>
          ,
          <year>2007</year>
          , pp.
          <fpage>198</fpage>
          -
          <lpage>209</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>C.</given-names>
            <surname>Hauf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Azzopardi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hiemstra</surname>
          </string-name>
          ,
          <article-title>The Combination and Evaluation of Query Performance Prediction Methods</article-title>
          ,
          <source>in: Proc. ECIR</source>
          ,
          <year>2009</year>
          , pp.
          <fpage>301</fpage>
          -
          <lpage>312</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>